/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:14:05,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:14:05,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:14:05,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:14:05,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:14:05,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:14:05,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:14:05,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:14:05,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:14:05,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:14:05,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:14:05,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:14:05,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:14:05,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:14:05,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:14:05,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:14:05,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:14:05,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:14:05,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:14:05,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:14:05,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:14:05,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:14:05,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:14:05,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:14:05,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:14:05,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:14:05,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:14:05,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:14:05,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:14:05,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:14:05,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:14:05,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:14:05,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:14:05,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:14:05,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:14:05,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:14:05,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:14:05,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:14:05,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:14:05,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:14:05,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:14:05,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 13:14:05,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:14:05,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:14:05,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:14:05,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:14:05,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:14:05,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:14:05,331 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:14:05,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:14:05,331 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:14:05,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:14:05,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:14:05,333 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:14:05,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:14:05,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:14:05,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:14:05,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:14:05,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:14:05,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:14:05,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:14:05,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:14:05,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:14:05,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:14:05,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:14:05,334 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:14:05,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:14:05,335 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:14:05,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 13:14:05,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:14:05,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:14:05,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:14:05,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:14:05,596 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:14:05,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-01-19 13:14:05,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a240bf427/b16969be2fbb414fba450d72361f0e86/FLAG93585cb38 [2022-01-19 13:14:06,015 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:14:06,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-01-19 13:14:06,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a240bf427/b16969be2fbb414fba450d72361f0e86/FLAG93585cb38 [2022-01-19 13:14:06,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a240bf427/b16969be2fbb414fba450d72361f0e86 [2022-01-19 13:14:06,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:14:06,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:14:06,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:14:06,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:14:06,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:14:06,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23794b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06, skipping insertion in model container [2022-01-19 13:14:06,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:14:06,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:14:06,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c[6450,6463] [2022-01-19 13:14:06,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:14:06,669 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:14:06,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c[6450,6463] [2022-01-19 13:14:06,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:14:06,718 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:14:06,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06 WrapperNode [2022-01-19 13:14:06,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:14:06,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:14:06,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:14:06,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:14:06,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,791 INFO L137 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 646 [2022-01-19 13:14:06,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:14:06,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:14:06,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:14:06,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:14:06,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:14:06,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:14:06,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:14:06,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:14:06,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (1/1) ... [2022-01-19 13:14:06,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:14:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:14:06,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 13:14:06,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:14:06,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:14:06,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:14:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:14:06,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:14:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:14:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 13:14:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:14:06,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:14:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:14:06,915 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 13:14:07,014 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:14:07,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:14:07,659 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:14:07,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:14:07,676 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 13:14:07,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:14:07 BoogieIcfgContainer [2022-01-19 13:14:07,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:14:07,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:14:07,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:14:07,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:14:07,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:14:06" (1/3) ... [2022-01-19 13:14:07,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ae8074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:14:07, skipping insertion in model container [2022-01-19 13:14:07,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:14:06" (2/3) ... [2022-01-19 13:14:07,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ae8074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:14:07, skipping insertion in model container [2022-01-19 13:14:07,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:14:07" (3/3) ... [2022-01-19 13:14:07,687 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2022-01-19 13:14:07,692 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:14:07,692 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:14:07,692 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:14:07,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,877 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,880 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,894 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,918 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,920 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,920 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,920 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,921 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,923 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,927 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,928 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,928 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,929 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,930 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,931 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,982 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,985 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,986 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,987 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,988 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,989 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,990 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,991 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,991 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,991 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,991 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,991 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,991 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,995 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:07,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,016 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:14:08,029 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 13:14:08,083 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:14:08,091 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 13:14:08,091 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 13:14:08,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 770 places, 851 transitions, 1726 flow [2022-01-19 13:14:08,465 INFO L129 PetriNetUnfolder]: 91/848 cut-off events. [2022-01-19 13:14:08,465 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:14:08,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 848 events. 91/848 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3044 event pairs, 0 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 622. Up to 2 conditions per place. [2022-01-19 13:14:08,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 770 places, 851 transitions, 1726 flow [2022-01-19 13:14:08,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 756 places, 837 transitions, 1692 flow [2022-01-19 13:14:08,779 INFO L129 PetriNetUnfolder]: 89/827 cut-off events. [2022-01-19 13:14:08,779 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:14:08,779 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:08,780 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:08,780 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1905717660, now seen corresponding path program 1 times [2022-01-19 13:14:08,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:08,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926293933] [2022-01-19 13:14:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:08,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:09,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926293933] [2022-01-19 13:14:09,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926293933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:09,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:09,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 13:14:09,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710688622] [2022-01-19 13:14:09,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:09,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 13:14:09,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:09,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 13:14:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 13:14:09,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 807 out of 851 [2022-01-19 13:14:09,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 837 transitions, 1692 flow. Second operand has 2 states, 2 states have (on average 811.5) internal successors, (1623), 2 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:09,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:09,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 807 of 851 [2022-01-19 13:14:09,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:09,409 INFO L129 PetriNetUnfolder]: 54/800 cut-off events. [2022-01-19 13:14:09,409 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-01-19 13:14:09,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 800 events. 54/800 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2980 event pairs, 0 based on Foata normal form. 60/775 useless extension candidates. Maximal degree in co-relation 597. Up to 7 conditions per place. [2022-01-19 13:14:09,438 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 6 selfloop transitions, 0 changer transitions 7/800 dead transitions. [2022-01-19 13:14:09,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 800 transitions, 1630 flow [2022-01-19 13:14:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 13:14:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 13:14:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1657 transitions. [2022-01-19 13:14:09,458 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9735605170387779 [2022-01-19 13:14:09,458 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1657 transitions. [2022-01-19 13:14:09,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1657 transitions. [2022-01-19 13:14:09,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:09,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1657 transitions. [2022-01-19 13:14:09,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 828.5) internal successors, (1657), 2 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:09,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 851.0) internal successors, (2553), 3 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:09,483 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 851.0) internal successors, (2553), 3 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:09,485 INFO L186 Difference]: Start difference. First operand has 756 places, 837 transitions, 1692 flow. Second operand 2 states and 1657 transitions. [2022-01-19 13:14:09,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 800 transitions, 1630 flow [2022-01-19 13:14:09,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 800 transitions, 1618 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 13:14:09,510 INFO L242 Difference]: Finished difference. Result has 751 places, 793 transitions, 1592 flow [2022-01-19 13:14:09,512 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1592, PETRI_PLACES=751, PETRI_TRANSITIONS=793} [2022-01-19 13:14:09,515 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2022-01-19 13:14:09,516 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 793 transitions, 1592 flow [2022-01-19 13:14:09,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 811.5) internal successors, (1623), 2 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:09,517 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:09,517 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:09,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:14:09,518 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1986224669, now seen corresponding path program 1 times [2022-01-19 13:14:09,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:09,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358753433] [2022-01-19 13:14:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:09,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:09,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:09,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358753433] [2022-01-19 13:14:09,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358753433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:09,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:09,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:09,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082907219] [2022-01-19 13:14:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:09,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:09,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:09,733 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 13:14:09,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 793 transitions, 1592 flow. Second operand has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:09,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:09,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 13:14:09,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:10,640 INFO L129 PetriNetUnfolder]: 352/3450 cut-off events. [2022-01-19 13:14:10,641 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-01-19 13:14:10,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 3450 events. 352/3450 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 30838 event pairs, 96 based on Foata normal form. 0/3062 useless extension candidates. Maximal degree in co-relation 3767. Up to 185 conditions per place. [2022-01-19 13:14:10,842 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 33 selfloop transitions, 2 changer transitions 0/808 dead transitions. [2022-01-19 13:14:10,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 808 transitions, 1697 flow [2022-01-19 13:14:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 13:14:10,848 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 13:14:10,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 13:14:10,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 13:14:10,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:10,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 13:14:10,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:10,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:10,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:10,861 INFO L186 Difference]: Start difference. First operand has 751 places, 793 transitions, 1592 flow. Second operand 3 states and 2416 transitions. [2022-01-19 13:14:10,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 808 transitions, 1697 flow [2022-01-19 13:14:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 808 transitions, 1697 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:14:10,875 INFO L242 Difference]: Finished difference. Result has 748 places, 795 transitions, 1612 flow [2022-01-19 13:14:10,876 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=748, PETRI_TRANSITIONS=795} [2022-01-19 13:14:10,877 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -8 predicate places. [2022-01-19 13:14:10,877 INFO L470 AbstractCegarLoop]: Abstraction has has 748 places, 795 transitions, 1612 flow [2022-01-19 13:14:10,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:10,879 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:10,879 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:10,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:14:10,879 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1365782035, now seen corresponding path program 2 times [2022-01-19 13:14:10,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:10,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659570576] [2022-01-19 13:14:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:10,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:10,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:10,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659570576] [2022-01-19 13:14:10,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659570576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:10,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:10,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:10,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785150137] [2022-01-19 13:14:10,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:10,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:10,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:10,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:10,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 13:14:10,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 795 transitions, 1612 flow. Second operand has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:10,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:10,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 13:14:10,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:12,084 INFO L129 PetriNetUnfolder]: 378/3800 cut-off events. [2022-01-19 13:14:12,084 INFO L130 PetriNetUnfolder]: For 112/121 co-relation queries the response was YES. [2022-01-19 13:14:12,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 3800 events. 378/3800 cut-off events. For 112/121 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 34195 event pairs, 98 based on Foata normal form. 6/3425 useless extension candidates. Maximal degree in co-relation 4202. Up to 201 conditions per place. [2022-01-19 13:14:12,196 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 33 selfloop transitions, 4 changer transitions 0/810 dead transitions. [2022-01-19 13:14:12,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 810 transitions, 1725 flow [2022-01-19 13:14:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 13:14:12,293 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 13:14:12,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 13:14:12,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 13:14:12,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:12,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 13:14:12,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:12,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:12,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:12,304 INFO L186 Difference]: Start difference. First operand has 748 places, 795 transitions, 1612 flow. Second operand 3 states and 2416 transitions. [2022-01-19 13:14:12,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 810 transitions, 1725 flow [2022-01-19 13:14:12,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 810 transitions, 1723 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:14:12,323 INFO L242 Difference]: Finished difference. Result has 751 places, 797 transitions, 1642 flow [2022-01-19 13:14:12,324 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=751, PETRI_TRANSITIONS=797} [2022-01-19 13:14:12,326 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2022-01-19 13:14:12,326 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 797 transitions, 1642 flow [2022-01-19 13:14:12,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:12,328 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:12,328 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:12,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:14:12,328 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 360113765, now seen corresponding path program 1 times [2022-01-19 13:14:12,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:12,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896351008] [2022-01-19 13:14:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:12,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:12,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:12,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896351008] [2022-01-19 13:14:12,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896351008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:12,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:12,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:12,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173402046] [2022-01-19 13:14:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:12,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:12,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:12,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 13:14:12,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 797 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:12,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:12,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 13:14:12,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:14,009 INFO L129 PetriNetUnfolder]: 789/6867 cut-off events. [2022-01-19 13:14:14,010 INFO L130 PetriNetUnfolder]: For 396/464 co-relation queries the response was YES. [2022-01-19 13:14:14,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7567 conditions, 6867 events. 789/6867 cut-off events. For 396/464 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 70955 event pairs, 210 based on Foata normal form. 4/6042 useless extension candidates. Maximal degree in co-relation 7561. Up to 390 conditions per place. [2022-01-19 13:14:14,130 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 32 selfloop transitions, 5 changer transitions 0/812 dead transitions. [2022-01-19 13:14:14,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 812 transitions, 1757 flow [2022-01-19 13:14:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2022-01-19 13:14:14,136 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-01-19 13:14:14,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2022-01-19 13:14:14,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2022-01-19 13:14:14,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:14,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2022-01-19 13:14:14,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.0) internal successors, (2415), 3 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:14,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:14,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:14,148 INFO L186 Difference]: Start difference. First operand has 751 places, 797 transitions, 1642 flow. Second operand 3 states and 2415 transitions. [2022-01-19 13:14:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 812 transitions, 1757 flow [2022-01-19 13:14:14,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 812 transitions, 1745 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:14:14,163 INFO L242 Difference]: Finished difference. Result has 753 places, 800 transitions, 1675 flow [2022-01-19 13:14:14,164 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=753, PETRI_TRANSITIONS=800} [2022-01-19 13:14:14,164 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -3 predicate places. [2022-01-19 13:14:14,164 INFO L470 AbstractCegarLoop]: Abstraction has has 753 places, 800 transitions, 1675 flow [2022-01-19 13:14:14,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:14,166 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:14,166 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:14,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:14:14,166 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1778547265, now seen corresponding path program 2 times [2022-01-19 13:14:14,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:14,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102335557] [2022-01-19 13:14:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:14,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:14,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:14,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102335557] [2022-01-19 13:14:14,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102335557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:14,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:14,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:14,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714800977] [2022-01-19 13:14:14,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:14,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:14,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:14,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:14,223 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 13:14:14,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 800 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:14,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:14,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 13:14:14,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:15,738 INFO L129 PetriNetUnfolder]: 771/6975 cut-off events. [2022-01-19 13:14:15,738 INFO L130 PetriNetUnfolder]: For 566/636 co-relation queries the response was YES. [2022-01-19 13:14:15,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7788 conditions, 6975 events. 771/6975 cut-off events. For 566/636 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 72272 event pairs, 211 based on Foata normal form. 9/6203 useless extension candidates. Maximal degree in co-relation 7781. Up to 405 conditions per place. [2022-01-19 13:14:15,869 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 37 selfloop transitions, 3 changer transitions 0/815 dead transitions. [2022-01-19 13:14:15,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 815 transitions, 1801 flow [2022-01-19 13:14:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2022-01-19 13:14:15,874 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-01-19 13:14:15,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2022-01-19 13:14:15,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2022-01-19 13:14:15,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:15,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2022-01-19 13:14:15,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.0) internal successors, (2415), 3 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:15,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:15,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:15,900 INFO L186 Difference]: Start difference. First operand has 753 places, 800 transitions, 1675 flow. Second operand 3 states and 2415 transitions. [2022-01-19 13:14:15,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 815 transitions, 1801 flow [2022-01-19 13:14:15,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 815 transitions, 1791 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:14:15,915 INFO L242 Difference]: Finished difference. Result has 755 places, 803 transitions, 1707 flow [2022-01-19 13:14:15,916 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1707, PETRI_PLACES=755, PETRI_TRANSITIONS=803} [2022-01-19 13:14:15,918 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -1 predicate places. [2022-01-19 13:14:15,919 INFO L470 AbstractCegarLoop]: Abstraction has has 755 places, 803 transitions, 1707 flow [2022-01-19 13:14:15,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:15,920 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:15,920 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:15,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:14:15,920 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:15,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1706386129, now seen corresponding path program 1 times [2022-01-19 13:14:15,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:15,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528923805] [2022-01-19 13:14:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:15,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:15,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528923805] [2022-01-19 13:14:15,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528923805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:15,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:15,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:15,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808081678] [2022-01-19 13:14:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:15,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:15,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:15,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:15,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:15,997 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 13:14:15,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 803 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:15,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:15,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 13:14:15,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:16,840 INFO L129 PetriNetUnfolder]: 296/3239 cut-off events. [2022-01-19 13:14:16,840 INFO L130 PetriNetUnfolder]: For 432/539 co-relation queries the response was YES. [2022-01-19 13:14:16,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 3239 events. 296/3239 cut-off events. For 432/539 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 29008 event pairs, 71 based on Foata normal form. 10/2970 useless extension candidates. Maximal degree in co-relation 3759. Up to 185 conditions per place. [2022-01-19 13:14:16,940 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 35 selfloop transitions, 4 changer transitions 0/818 dead transitions. [2022-01-19 13:14:16,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 818 transitions, 1828 flow [2022-01-19 13:14:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 13:14:16,946 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 13:14:16,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 13:14:16,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 13:14:16,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:16,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 13:14:16,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:16,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:16,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:16,957 INFO L186 Difference]: Start difference. First operand has 755 places, 803 transitions, 1707 flow. Second operand 3 states and 2416 transitions. [2022-01-19 13:14:16,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 818 transitions, 1828 flow [2022-01-19 13:14:16,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 818 transitions, 1819 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-01-19 13:14:16,971 INFO L242 Difference]: Finished difference. Result has 758 places, 805 transitions, 1738 flow [2022-01-19 13:14:16,973 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1738, PETRI_PLACES=758, PETRI_TRANSITIONS=805} [2022-01-19 13:14:16,974 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 2 predicate places. [2022-01-19 13:14:16,974 INFO L470 AbstractCegarLoop]: Abstraction has has 758 places, 805 transitions, 1738 flow [2022-01-19 13:14:16,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:16,975 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:16,975 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:16,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:14:16,975 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2139301649, now seen corresponding path program 2 times [2022-01-19 13:14:16,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:16,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768788292] [2022-01-19 13:14:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:16,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:17,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:17,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768788292] [2022-01-19 13:14:17,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768788292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:17,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:17,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:17,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229391397] [2022-01-19 13:14:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:17,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:17,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:17,036 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 13:14:17,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 805 transitions, 1738 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:17,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:17,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 13:14:17,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:17,725 INFO L129 PetriNetUnfolder]: 259/2956 cut-off events. [2022-01-19 13:14:17,726 INFO L130 PetriNetUnfolder]: For 637/733 co-relation queries the response was YES. [2022-01-19 13:14:17,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 2956 events. 259/2956 cut-off events. For 637/733 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 25755 event pairs, 74 based on Foata normal form. 8/2722 useless extension candidates. Maximal degree in co-relation 3542. Up to 190 conditions per place. [2022-01-19 13:14:17,821 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 35 selfloop transitions, 6 changer transitions 0/818 dead transitions. [2022-01-19 13:14:17,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 818 transitions, 1857 flow [2022-01-19 13:14:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 13:14:17,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 13:14:17,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 13:14:17,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 13:14:17,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:17,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 13:14:17,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:17,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:17,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:17,836 INFO L186 Difference]: Start difference. First operand has 758 places, 805 transitions, 1738 flow. Second operand 3 states and 2416 transitions. [2022-01-19 13:14:17,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 818 transitions, 1857 flow [2022-01-19 13:14:17,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 818 transitions, 1853 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:14:17,850 INFO L242 Difference]: Finished difference. Result has 761 places, 805 transitions, 1776 flow [2022-01-19 13:14:17,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=761, PETRI_TRANSITIONS=805} [2022-01-19 13:14:17,851 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 5 predicate places. [2022-01-19 13:14:17,852 INFO L470 AbstractCegarLoop]: Abstraction has has 761 places, 805 transitions, 1776 flow [2022-01-19 13:14:17,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:17,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:17,853 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:17,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:14:17,853 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1541370568, now seen corresponding path program 1 times [2022-01-19 13:14:17,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:17,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501785632] [2022-01-19 13:14:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:17,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:14:17,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501785632] [2022-01-19 13:14:17,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501785632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:17,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:17,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:14:17,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974529895] [2022-01-19 13:14:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:17,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:14:17,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:14:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:14:17,930 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 774 out of 851 [2022-01-19 13:14:17,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 805 transitions, 1776 flow. Second operand has 5 states, 5 states have (on average 779.4) internal successors, (3897), 5 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:17,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:17,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 774 of 851 [2022-01-19 13:14:17,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:18,236 INFO L129 PetriNetUnfolder]: 54/1036 cut-off events. [2022-01-19 13:14:18,236 INFO L130 PetriNetUnfolder]: For 141/179 co-relation queries the response was YES. [2022-01-19 13:14:18,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 1036 events. 54/1036 cut-off events. For 141/179 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5277 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1196. Up to 55 conditions per place. [2022-01-19 13:14:18,264 INFO L132 encePairwiseOnDemand]: 836/851 looper letters, 39 selfloop transitions, 12 changer transitions 0/817 dead transitions. [2022-01-19 13:14:18,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 817 transitions, 1902 flow [2022-01-19 13:14:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:14:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:14:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3924 transitions. [2022-01-19 13:14:18,273 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9222091656874265 [2022-01-19 13:14:18,273 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3924 transitions. [2022-01-19 13:14:18,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3924 transitions. [2022-01-19 13:14:18,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:18,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3924 transitions. [2022-01-19 13:14:18,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 784.8) internal successors, (3924), 5 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:18,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:18,291 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:18,292 INFO L186 Difference]: Start difference. First operand has 761 places, 805 transitions, 1776 flow. Second operand 5 states and 3924 transitions. [2022-01-19 13:14:18,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 817 transitions, 1902 flow [2022-01-19 13:14:18,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 763 places, 817 transitions, 1886 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:14:18,306 INFO L242 Difference]: Finished difference. Result has 764 places, 808 transitions, 1808 flow [2022-01-19 13:14:18,307 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=764, PETRI_TRANSITIONS=808} [2022-01-19 13:14:18,308 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 8 predicate places. [2022-01-19 13:14:18,308 INFO L470 AbstractCegarLoop]: Abstraction has has 764 places, 808 transitions, 1808 flow [2022-01-19 13:14:18,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 779.4) internal successors, (3897), 5 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:18,309 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:18,309 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:18,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:14:18,310 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash -502605305, now seen corresponding path program 1 times [2022-01-19 13:14:18,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:18,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007904433] [2022-01-19 13:14:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:18,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 13:14:18,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007904433] [2022-01-19 13:14:18,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007904433] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:14:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173769758] [2022-01-19 13:14:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:18,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:18,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:14:18,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:14:18,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 13:14:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:18,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 13:14:18,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:14:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 13:14:19,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:14:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 13:14:19,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173769758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:14:19,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:14:19,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-01-19 13:14:19,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138410121] [2022-01-19 13:14:19,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:14:19,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 13:14:19,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:19,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 13:14:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-19 13:14:19,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2022-01-19 13:14:19,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 808 transitions, 1808 flow. Second operand has 15 states, 15 states have (on average 775.0666666666667) internal successors, (11626), 15 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:19,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:19,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2022-01-19 13:14:19,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:20,122 INFO L129 PetriNetUnfolder]: 54/1060 cut-off events. [2022-01-19 13:14:20,122 INFO L130 PetriNetUnfolder]: For 133/170 co-relation queries the response was YES. [2022-01-19 13:14:20,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 1060 events. 54/1060 cut-off events. For 133/170 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5260 event pairs, 0 based on Foata normal form. 6/987 useless extension candidates. Maximal degree in co-relation 1260. Up to 46 conditions per place. [2022-01-19 13:14:20,157 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 42 selfloop transitions, 33 changer transitions 0/838 dead transitions. [2022-01-19 13:14:20,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 838 transitions, 2024 flow [2022-01-19 13:14:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:14:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:14:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8562 transitions. [2022-01-19 13:14:20,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9146458711676103 [2022-01-19 13:14:20,172 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8562 transitions. [2022-01-19 13:14:20,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8562 transitions. [2022-01-19 13:14:20,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:20,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8562 transitions. [2022-01-19 13:14:20,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 778.3636363636364) internal successors, (8562), 11 states have internal predecessors, (8562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:20,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:20,208 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:20,208 INFO L186 Difference]: Start difference. First operand has 764 places, 808 transitions, 1808 flow. Second operand 11 states and 8562 transitions. [2022-01-19 13:14:20,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 838 transitions, 2024 flow [2022-01-19 13:14:20,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 771 places, 838 transitions, 2006 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 13:14:20,223 INFO L242 Difference]: Finished difference. Result has 774 places, 826 transitions, 1957 flow [2022-01-19 13:14:20,224 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1957, PETRI_PLACES=774, PETRI_TRANSITIONS=826} [2022-01-19 13:14:20,225 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 18 predicate places. [2022-01-19 13:14:20,225 INFO L470 AbstractCegarLoop]: Abstraction has has 774 places, 826 transitions, 1957 flow [2022-01-19 13:14:20,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 775.0666666666667) internal successors, (11626), 15 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:20,228 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:20,228 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:20,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 13:14:20,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:20,456 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1742006581, now seen corresponding path program 2 times [2022-01-19 13:14:20,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:20,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460052954] [2022-01-19 13:14:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:20,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 13:14:20,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:20,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460052954] [2022-01-19 13:14:20,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460052954] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:14:20,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844120012] [2022-01-19 13:14:20,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:14:20,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:20,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:14:20,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:14:20,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 13:14:20,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 13:14:20,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:14:20,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 13:14:20,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:14:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-19 13:14:21,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 13:14:21,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844120012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:21,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 13:14:21,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 13:14:21,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654497718] [2022-01-19 13:14:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:21,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:14:21,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:14:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:14:21,200 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2022-01-19 13:14:21,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 826 transitions, 1957 flow. Second operand has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:21,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:21,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2022-01-19 13:14:21,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:23,108 INFO L129 PetriNetUnfolder]: 1481/7153 cut-off events. [2022-01-19 13:14:23,109 INFO L130 PetriNetUnfolder]: For 3573/3940 co-relation queries the response was YES. [2022-01-19 13:14:23,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11183 conditions, 7153 events. 1481/7153 cut-off events. For 3573/3940 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 75410 event pairs, 700 based on Foata normal form. 4/6534 useless extension candidates. Maximal degree in co-relation 11169. Up to 1335 conditions per place. [2022-01-19 13:14:23,266 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 111 selfloop transitions, 23 changer transitions 2/896 dead transitions. [2022-01-19 13:14:23,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 896 transitions, 2413 flow [2022-01-19 13:14:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:14:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:14:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5414 transitions. [2022-01-19 13:14:23,275 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088467349336915 [2022-01-19 13:14:23,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5414 transitions. [2022-01-19 13:14:23,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5414 transitions. [2022-01-19 13:14:23,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:23,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5414 transitions. [2022-01-19 13:14:23,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 773.4285714285714) internal successors, (5414), 7 states have internal predecessors, (5414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:23,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:23,293 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:23,294 INFO L186 Difference]: Start difference. First operand has 774 places, 826 transitions, 1957 flow. Second operand 7 states and 5414 transitions. [2022-01-19 13:14:23,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 896 transitions, 2413 flow [2022-01-19 13:14:23,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 896 transitions, 2388 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-01-19 13:14:23,313 INFO L242 Difference]: Finished difference. Result has 780 places, 838 transitions, 2035 flow [2022-01-19 13:14:23,316 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2035, PETRI_PLACES=780, PETRI_TRANSITIONS=838} [2022-01-19 13:14:23,317 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 24 predicate places. [2022-01-19 13:14:23,317 INFO L470 AbstractCegarLoop]: Abstraction has has 780 places, 838 transitions, 2035 flow [2022-01-19 13:14:23,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:23,318 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:23,318 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:23,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 13:14:23,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 13:14:23,528 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1654571657, now seen corresponding path program 3 times [2022-01-19 13:14:23,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:23,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682856537] [2022-01-19 13:14:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:23,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 13:14:23,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:23,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682856537] [2022-01-19 13:14:23,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682856537] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:14:23,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488453773] [2022-01-19 13:14:23,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 13:14:23,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:23,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:14:23,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:14:23,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 13:14:23,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-19 13:14:23,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:14:23,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 13:14:23,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:14:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-19 13:14:24,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 13:14:24,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488453773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:24,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 13:14:24,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 13:14:24,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301863820] [2022-01-19 13:14:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:24,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:14:24,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:14:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:14:24,281 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2022-01-19 13:14:24,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 838 transitions, 2035 flow. Second operand has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:24,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:24,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2022-01-19 13:14:24,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:26,204 INFO L129 PetriNetUnfolder]: 1489/7547 cut-off events. [2022-01-19 13:14:26,204 INFO L130 PetriNetUnfolder]: For 5189/5647 co-relation queries the response was YES. [2022-01-19 13:14:26,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 7547 events. 1489/7547 cut-off events. For 5189/5647 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 80398 event pairs, 369 based on Foata normal form. 81/7141 useless extension candidates. Maximal degree in co-relation 11652. Up to 855 conditions per place. [2022-01-19 13:14:26,435 INFO L132 encePairwiseOnDemand]: 824/851 looper letters, 133 selfloop transitions, 43 changer transitions 1/937 dead transitions. [2022-01-19 13:14:26,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 937 transitions, 2763 flow [2022-01-19 13:14:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:14:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:14:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6949 transitions. [2022-01-19 13:14:26,447 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072986029507769 [2022-01-19 13:14:26,447 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6949 transitions. [2022-01-19 13:14:26,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6949 transitions. [2022-01-19 13:14:26,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:26,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6949 transitions. [2022-01-19 13:14:26,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 772.1111111111111) internal successors, (6949), 9 states have internal predecessors, (6949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:26,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:26,467 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:26,468 INFO L186 Difference]: Start difference. First operand has 780 places, 838 transitions, 2035 flow. Second operand 9 states and 6949 transitions. [2022-01-19 13:14:26,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 937 transitions, 2763 flow [2022-01-19 13:14:26,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 937 transitions, 2763 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:14:26,492 INFO L242 Difference]: Finished difference. Result has 792 places, 864 transitions, 2357 flow [2022-01-19 13:14:26,493 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2357, PETRI_PLACES=792, PETRI_TRANSITIONS=864} [2022-01-19 13:14:26,494 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 36 predicate places. [2022-01-19 13:14:26,494 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 864 transitions, 2357 flow [2022-01-19 13:14:26,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:26,495 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:26,496 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:26,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 13:14:26,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:26,719 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -526497641, now seen corresponding path program 4 times [2022-01-19 13:14:26,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:26,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363066869] [2022-01-19 13:14:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:26,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 13:14:26,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:26,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363066869] [2022-01-19 13:14:26,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363066869] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:14:26,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989077972] [2022-01-19 13:14:26,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 13:14:26,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:26,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:14:26,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:14:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 13:14:27,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 13:14:27,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:14:27,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 13:14:27,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:14:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 13:14:27,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:14:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 13:14:28,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989077972] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:14:28,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:14:28,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-01-19 13:14:28,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386835084] [2022-01-19 13:14:28,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:14:28,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 13:14:28,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 13:14:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-01-19 13:14:28,035 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2022-01-19 13:14:28,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 864 transitions, 2357 flow. Second operand has 22 states, 22 states have (on average 774.6818181818181) internal successors, (17043), 22 states have internal predecessors, (17043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:28,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:28,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2022-01-19 13:14:28,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:28,879 INFO L129 PetriNetUnfolder]: 142/1959 cut-off events. [2022-01-19 13:14:28,879 INFO L130 PetriNetUnfolder]: For 1243/1393 co-relation queries the response was YES. [2022-01-19 13:14:28,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1959 events. 142/1959 cut-off events. For 1243/1393 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14170 event pairs, 9 based on Foata normal form. 6/1839 useless extension candidates. Maximal degree in co-relation 2813. Up to 75 conditions per place. [2022-01-19 13:14:28,933 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 54 selfloop transitions, 51 changer transitions 0/906 dead transitions. [2022-01-19 13:14:28,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 906 transitions, 2735 flow [2022-01-19 13:14:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:14:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:14:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 13218 transitions. [2022-01-19 13:14:28,953 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9136655837423101 [2022-01-19 13:14:28,953 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 13218 transitions. [2022-01-19 13:14:28,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 13218 transitions. [2022-01-19 13:14:28,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:28,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 13218 transitions. [2022-01-19 13:14:28,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 777.5294117647059) internal successors, (13218), 17 states have internal predecessors, (13218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:28,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 851.0) internal successors, (15318), 18 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:28,985 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 851.0) internal successors, (15318), 18 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:28,985 INFO L186 Difference]: Start difference. First operand has 792 places, 864 transitions, 2357 flow. Second operand 17 states and 13218 transitions. [2022-01-19 13:14:28,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 906 transitions, 2735 flow [2022-01-19 13:14:28,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 906 transitions, 2729 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-01-19 13:14:29,005 INFO L242 Difference]: Finished difference. Result has 811 places, 885 transitions, 2614 flow [2022-01-19 13:14:29,006 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2614, PETRI_PLACES=811, PETRI_TRANSITIONS=885} [2022-01-19 13:14:29,007 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 55 predicate places. [2022-01-19 13:14:29,007 INFO L470 AbstractCegarLoop]: Abstraction has has 811 places, 885 transitions, 2614 flow [2022-01-19 13:14:29,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 774.6818181818181) internal successors, (17043), 22 states have internal predecessors, (17043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:29,009 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:29,009 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:29,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 13:14:29,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:14:29,226 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 862760163, now seen corresponding path program 5 times [2022-01-19 13:14:29,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916966926] [2022-01-19 13:14:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:29,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:14:29,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:29,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916966926] [2022-01-19 13:14:29,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916966926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:29,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:29,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:29,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764838100] [2022-01-19 13:14:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:29,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:29,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:29,324 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 13:14:29,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 885 transitions, 2614 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:29,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:29,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 13:14:29,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:30,981 INFO L129 PetriNetUnfolder]: 584/6149 cut-off events. [2022-01-19 13:14:30,982 INFO L130 PetriNetUnfolder]: For 1859/2037 co-relation queries the response was YES. [2022-01-19 13:14:31,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 6149 events. 584/6149 cut-off events. For 1859/2037 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 61001 event pairs, 103 based on Foata normal form. 2/5625 useless extension candidates. Maximal degree in co-relation 8004. Up to 300 conditions per place. [2022-01-19 13:14:31,212 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 28 selfloop transitions, 4 changer transitions 0/894 dead transitions. [2022-01-19 13:14:31,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 894 transitions, 2700 flow [2022-01-19 13:14:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2403 transitions. [2022-01-19 13:14:31,219 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412455934195064 [2022-01-19 13:14:31,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2403 transitions. [2022-01-19 13:14:31,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2403 transitions. [2022-01-19 13:14:31,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:31,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2403 transitions. [2022-01-19 13:14:31,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 801.0) internal successors, (2403), 3 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:31,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:31,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:31,225 INFO L186 Difference]: Start difference. First operand has 811 places, 885 transitions, 2614 flow. Second operand 3 states and 2403 transitions. [2022-01-19 13:14:31,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 894 transitions, 2700 flow [2022-01-19 13:14:31,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 894 transitions, 2633 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-01-19 13:14:31,259 INFO L242 Difference]: Finished difference. Result has 806 places, 886 transitions, 2565 flow [2022-01-19 13:14:31,260 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2565, PETRI_PLACES=806, PETRI_TRANSITIONS=886} [2022-01-19 13:14:31,261 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 50 predicate places. [2022-01-19 13:14:31,261 INFO L470 AbstractCegarLoop]: Abstraction has has 806 places, 886 transitions, 2565 flow [2022-01-19 13:14:31,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:31,262 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:31,262 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:31,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:14:31,262 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:31,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1570533334, now seen corresponding path program 1 times [2022-01-19 13:14:31,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:31,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429525152] [2022-01-19 13:14:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:31,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:14:31,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:31,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429525152] [2022-01-19 13:14:31,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429525152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:31,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:31,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:31,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8650314] [2022-01-19 13:14:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:31,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:31,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:31,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:31,357 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 13:14:31,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 886 transitions, 2565 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:31,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:31,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 13:14:31,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:34,100 INFO L129 PetriNetUnfolder]: 629/8651 cut-off events. [2022-01-19 13:14:34,100 INFO L130 PetriNetUnfolder]: For 2559/2857 co-relation queries the response was YES. [2022-01-19 13:14:34,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11007 conditions, 8651 events. 629/8651 cut-off events. For 2559/2857 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 87955 event pairs, 38 based on Foata normal form. 0/7969 useless extension candidates. Maximal degree in co-relation 10980. Up to 179 conditions per place. [2022-01-19 13:14:34,288 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 29 selfloop transitions, 4 changer transitions 0/896 dead transitions. [2022-01-19 13:14:34,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 896 transitions, 2656 flow [2022-01-19 13:14:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2404 transitions. [2022-01-19 13:14:34,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416372894633764 [2022-01-19 13:14:34,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2404 transitions. [2022-01-19 13:14:34,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2404 transitions. [2022-01-19 13:14:34,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:34,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2404 transitions. [2022-01-19 13:14:34,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 801.3333333333334) internal successors, (2404), 3 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:34,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:34,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:34,297 INFO L186 Difference]: Start difference. First operand has 806 places, 886 transitions, 2565 flow. Second operand 3 states and 2404 transitions. [2022-01-19 13:14:34,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 896 transitions, 2656 flow [2022-01-19 13:14:34,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 896 transitions, 2652 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:14:34,330 INFO L242 Difference]: Finished difference. Result has 808 places, 887 transitions, 2579 flow [2022-01-19 13:14:34,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2561, PETRI_DIFFERENCE_MINUEND_PLACES=805, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2579, PETRI_PLACES=808, PETRI_TRANSITIONS=887} [2022-01-19 13:14:34,332 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 52 predicate places. [2022-01-19 13:14:34,332 INFO L470 AbstractCegarLoop]: Abstraction has has 808 places, 887 transitions, 2579 flow [2022-01-19 13:14:34,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:34,332 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:34,333 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:34,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:14:34,333 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1945096870, now seen corresponding path program 1 times [2022-01-19 13:14:34,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:34,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16862546] [2022-01-19 13:14:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:34,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:14:34,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:34,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16862546] [2022-01-19 13:14:34,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16862546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:34,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:34,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:14:34,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784146342] [2022-01-19 13:14:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:34,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:14:34,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:14:34,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:14:34,440 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 13:14:34,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 887 transitions, 2579 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:34,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:34,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 13:14:34,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:36,507 INFO L129 PetriNetUnfolder]: 1137/9273 cut-off events. [2022-01-19 13:14:36,507 INFO L130 PetriNetUnfolder]: For 2029/2488 co-relation queries the response was YES. [2022-01-19 13:14:36,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11478 conditions, 9273 events. 1137/9273 cut-off events. For 2029/2488 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 101223 event pairs, 380 based on Foata normal form. 1/8072 useless extension candidates. Maximal degree in co-relation 11450. Up to 952 conditions per place. [2022-01-19 13:14:36,644 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 27 selfloop transitions, 4 changer transitions 0/895 dead transitions. [2022-01-19 13:14:36,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 895 transitions, 2660 flow [2022-01-19 13:14:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:14:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:14:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2402 transitions. [2022-01-19 13:14:36,648 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9408538973756365 [2022-01-19 13:14:36,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2402 transitions. [2022-01-19 13:14:36,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2402 transitions. [2022-01-19 13:14:36,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:36,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2402 transitions. [2022-01-19 13:14:36,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 800.6666666666666) internal successors, (2402), 3 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:36,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:36,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:36,653 INFO L186 Difference]: Start difference. First operand has 808 places, 887 transitions, 2579 flow. Second operand 3 states and 2402 transitions. [2022-01-19 13:14:36,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 895 transitions, 2660 flow [2022-01-19 13:14:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 895 transitions, 2656 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:14:36,672 INFO L242 Difference]: Finished difference. Result has 810 places, 888 transitions, 2593 flow [2022-01-19 13:14:36,673 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2593, PETRI_PLACES=810, PETRI_TRANSITIONS=888} [2022-01-19 13:14:36,674 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 54 predicate places. [2022-01-19 13:14:36,674 INFO L470 AbstractCegarLoop]: Abstraction has has 810 places, 888 transitions, 2593 flow [2022-01-19 13:14:36,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:36,674 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:36,674 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:36,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:14:36,675 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:36,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1735256126, now seen corresponding path program 1 times [2022-01-19 13:14:36,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:36,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040991198] [2022-01-19 13:14:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:36,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:14:36,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:36,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040991198] [2022-01-19 13:14:36,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040991198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:36,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:36,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:14:36,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805439947] [2022-01-19 13:14:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:36,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:14:36,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:36,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:14:36,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:14:36,840 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:14:36,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 888 transitions, 2593 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:36,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:36,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:14:36,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:49,450 INFO L129 PetriNetUnfolder]: 8778/52330 cut-off events. [2022-01-19 13:14:49,450 INFO L130 PetriNetUnfolder]: For 37937/44699 co-relation queries the response was YES. [2022-01-19 13:14:50,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81506 conditions, 52330 events. 8778/52330 cut-off events. For 37937/44699 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 760276 event pairs, 3260 based on Foata normal form. 310/49102 useless extension candidates. Maximal degree in co-relation 81477. Up to 4529 conditions per place. [2022-01-19 13:14:50,494 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 214 selfloop transitions, 21 changer transitions 2/1034 dead transitions. [2022-01-19 13:14:50,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 1034 transitions, 3682 flow [2022-01-19 13:14:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:14:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:14:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5432 transitions. [2022-01-19 13:14:50,498 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9118683901292597 [2022-01-19 13:14:50,498 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5432 transitions. [2022-01-19 13:14:50,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5432 transitions. [2022-01-19 13:14:50,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:50,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5432 transitions. [2022-01-19 13:14:50,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 776.0) internal successors, (5432), 7 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:50,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:50,509 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:50,509 INFO L186 Difference]: Start difference. First operand has 810 places, 888 transitions, 2593 flow. Second operand 7 states and 5432 transitions. [2022-01-19 13:14:50,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 1034 transitions, 3682 flow [2022-01-19 13:14:50,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 1034 transitions, 3678 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:14:50,744 INFO L242 Difference]: Finished difference. Result has 820 places, 910 transitions, 2877 flow [2022-01-19 13:14:50,745 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2589, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2877, PETRI_PLACES=820, PETRI_TRANSITIONS=910} [2022-01-19 13:14:50,745 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 64 predicate places. [2022-01-19 13:14:50,746 INFO L470 AbstractCegarLoop]: Abstraction has has 820 places, 910 transitions, 2877 flow [2022-01-19 13:14:50,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:50,746 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:50,747 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:14:50,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 13:14:50,747 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:14:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash -223892668, now seen corresponding path program 2 times [2022-01-19 13:14:50,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:50,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182051337] [2022-01-19 13:14:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:50,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:14:50,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:50,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182051337] [2022-01-19 13:14:50,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182051337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:50,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:50,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:14:50,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944002179] [2022-01-19 13:14:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:50,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:14:50,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:14:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:14:50,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:14:50,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 910 transitions, 2877 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:14:50,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:50,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:14:50,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:02,769 INFO L129 PetriNetUnfolder]: 8593/48956 cut-off events. [2022-01-19 13:15:02,770 INFO L130 PetriNetUnfolder]: For 51841/60724 co-relation queries the response was YES. [2022-01-19 13:15:03,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81244 conditions, 48956 events. 8593/48956 cut-off events. For 51841/60724 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 699842 event pairs, 3042 based on Foata normal form. 435/46751 useless extension candidates. Maximal degree in co-relation 81211. Up to 4529 conditions per place. [2022-01-19 13:15:04,099 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 184 selfloop transitions, 21 changer transitions 3/1005 dead transitions. [2022-01-19 13:15:04,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 1005 transitions, 3719 flow [2022-01-19 13:15:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:15:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:15:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5402 transitions. [2022-01-19 13:15:04,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906832298136646 [2022-01-19 13:15:04,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5402 transitions. [2022-01-19 13:15:04,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5402 transitions. [2022-01-19 13:15:04,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:04,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5402 transitions. [2022-01-19 13:15:04,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 771.7142857142857) internal successors, (5402), 7 states have internal predecessors, (5402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:04,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:04,116 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:04,116 INFO L186 Difference]: Start difference. First operand has 820 places, 910 transitions, 2877 flow. Second operand 7 states and 5402 transitions. [2022-01-19 13:15:04,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 1005 transitions, 3719 flow [2022-01-19 13:15:04,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 1005 transitions, 3719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:15:04,311 INFO L242 Difference]: Finished difference. Result has 828 places, 912 transitions, 2977 flow [2022-01-19 13:15:04,312 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2977, PETRI_PLACES=828, PETRI_TRANSITIONS=912} [2022-01-19 13:15:04,312 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 72 predicate places. [2022-01-19 13:15:04,313 INFO L470 AbstractCegarLoop]: Abstraction has has 828 places, 912 transitions, 2977 flow [2022-01-19 13:15:04,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:04,313 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:04,314 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:15:04,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 13:15:04,314 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:15:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -557134478, now seen corresponding path program 3 times [2022-01-19 13:15:04,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:04,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357889241] [2022-01-19 13:15:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:04,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:15:04,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:04,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357889241] [2022-01-19 13:15:04,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357889241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:04,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:04,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:15:04,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389509189] [2022-01-19 13:15:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:04,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:15:04,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:15:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:15:04,478 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:15:04,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 912 transitions, 2977 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:04,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:04,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:15:04,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:18,335 INFO L129 PetriNetUnfolder]: 9322/54905 cut-off events. [2022-01-19 13:15:18,335 INFO L130 PetriNetUnfolder]: For 66735/75920 co-relation queries the response was YES. [2022-01-19 13:15:19,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91388 conditions, 54905 events. 9322/54905 cut-off events. For 66735/75920 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 808336 event pairs, 4814 based on Foata normal form. 327/52394 useless extension candidates. Maximal degree in co-relation 91352. Up to 8166 conditions per place. [2022-01-19 13:15:19,729 INFO L132 encePairwiseOnDemand]: 835/851 looper letters, 199 selfloop transitions, 35 changer transitions 4/1035 dead transitions. [2022-01-19 13:15:19,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 1035 transitions, 3932 flow [2022-01-19 13:15:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:15:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:15:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4666 transitions. [2022-01-19 13:15:19,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9138268703486094 [2022-01-19 13:15:19,732 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4666 transitions. [2022-01-19 13:15:19,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4666 transitions. [2022-01-19 13:15:19,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:19,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4666 transitions. [2022-01-19 13:15:19,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 777.6666666666666) internal successors, (4666), 6 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:19,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:19,741 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:19,741 INFO L186 Difference]: Start difference. First operand has 828 places, 912 transitions, 2977 flow. Second operand 6 states and 4666 transitions. [2022-01-19 13:15:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 1035 transitions, 3932 flow [2022-01-19 13:15:19,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 1035 transitions, 3883 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-01-19 13:15:19,954 INFO L242 Difference]: Finished difference. Result has 834 places, 935 transitions, 3267 flow [2022-01-19 13:15:19,954 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3267, PETRI_PLACES=834, PETRI_TRANSITIONS=935} [2022-01-19 13:15:19,955 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 78 predicate places. [2022-01-19 13:15:19,955 INFO L470 AbstractCegarLoop]: Abstraction has has 834 places, 935 transitions, 3267 flow [2022-01-19 13:15:19,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:19,955 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:19,956 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:15:19,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:15:19,956 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:15:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash -779960328, now seen corresponding path program 4 times [2022-01-19 13:15:19,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:19,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692977115] [2022-01-19 13:15:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:19,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:15:20,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:20,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692977115] [2022-01-19 13:15:20,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692977115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:20,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:20,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:15:20,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777286239] [2022-01-19 13:15:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:20,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:15:20,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:15:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:15:20,109 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:15:20,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 935 transitions, 3267 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:20,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:20,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:15:20,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:35,909 INFO L129 PetriNetUnfolder]: 9788/63753 cut-off events. [2022-01-19 13:15:35,910 INFO L130 PetriNetUnfolder]: For 76890/83300 co-relation queries the response was YES. [2022-01-19 13:15:37,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104705 conditions, 63753 events. 9788/63753 cut-off events. For 76890/83300 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 976826 event pairs, 5758 based on Foata normal form. 41/60431 useless extension candidates. Maximal degree in co-relation 104665. Up to 10305 conditions per place. [2022-01-19 13:15:37,775 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 214 selfloop transitions, 24 changer transitions 13/1048 dead transitions. [2022-01-19 13:15:37,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 1048 transitions, 4153 flow [2022-01-19 13:15:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:15:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:15:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5413 transitions. [2022-01-19 13:15:37,779 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9086788652006044 [2022-01-19 13:15:37,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5413 transitions. [2022-01-19 13:15:37,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5413 transitions. [2022-01-19 13:15:37,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:37,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5413 transitions. [2022-01-19 13:15:37,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 773.2857142857143) internal successors, (5413), 7 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:37,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:37,787 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:37,787 INFO L186 Difference]: Start difference. First operand has 834 places, 935 transitions, 3267 flow. Second operand 7 states and 5413 transitions. [2022-01-19 13:15:37,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 1048 transitions, 4153 flow [2022-01-19 13:15:38,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 1048 transitions, 4143 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-01-19 13:15:38,316 INFO L242 Difference]: Finished difference. Result has 842 places, 938 transitions, 3368 flow [2022-01-19 13:15:38,317 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3368, PETRI_PLACES=842, PETRI_TRANSITIONS=938} [2022-01-19 13:15:38,317 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 86 predicate places. [2022-01-19 13:15:38,317 INFO L470 AbstractCegarLoop]: Abstraction has has 842 places, 938 transitions, 3368 flow [2022-01-19 13:15:38,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:38,318 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:38,318 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:15:38,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 13:15:38,319 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:15:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 173589260, now seen corresponding path program 1 times [2022-01-19 13:15:38,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:38,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890436228] [2022-01-19 13:15:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:38,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:15:38,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:38,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890436228] [2022-01-19 13:15:38,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890436228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:38,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:38,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:15:38,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364927511] [2022-01-19 13:15:38,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:38,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:15:38,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:15:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:15:38,445 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 851 [2022-01-19 13:15:38,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 842 places, 938 transitions, 3368 flow. Second operand has 6 states, 6 states have (on average 764.5) internal successors, (4587), 6 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:38,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:38,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 851 [2022-01-19 13:15:38,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:42,122 INFO L129 PetriNetUnfolder]: 839/11109 cut-off events. [2022-01-19 13:15:42,122 INFO L130 PetriNetUnfolder]: For 9757/12404 co-relation queries the response was YES. [2022-01-19 13:15:42,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 11109 events. 839/11109 cut-off events. For 9757/12404 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 127064 event pairs, 77 based on Foata normal form. 58/10286 useless extension candidates. Maximal degree in co-relation 15355. Up to 741 conditions per place. [2022-01-19 13:15:42,363 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 55 selfloop transitions, 3 changer transitions 4/952 dead transitions. [2022-01-19 13:15:42,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 952 transitions, 3529 flow [2022-01-19 13:15:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:15:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:15:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5369 transitions. [2022-01-19 13:15:42,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9012925969447708 [2022-01-19 13:15:42,367 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5369 transitions. [2022-01-19 13:15:42,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5369 transitions. [2022-01-19 13:15:42,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:42,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5369 transitions. [2022-01-19 13:15:42,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 767.0) internal successors, (5369), 7 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:42,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:42,375 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:42,376 INFO L186 Difference]: Start difference. First operand has 842 places, 938 transitions, 3368 flow. Second operand 7 states and 5369 transitions. [2022-01-19 13:15:42,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 952 transitions, 3529 flow [2022-01-19 13:15:42,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 843 places, 952 transitions, 3506 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 13:15:42,417 INFO L242 Difference]: Finished difference. Result has 848 places, 940 transitions, 3370 flow [2022-01-19 13:15:42,418 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3345, PETRI_DIFFERENCE_MINUEND_PLACES=837, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3370, PETRI_PLACES=848, PETRI_TRANSITIONS=940} [2022-01-19 13:15:42,419 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 92 predicate places. [2022-01-19 13:15:42,419 INFO L470 AbstractCegarLoop]: Abstraction has has 848 places, 940 transitions, 3370 flow [2022-01-19 13:15:42,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 764.5) internal successors, (4587), 6 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:42,419 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:42,419 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:15:42,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 13:15:42,420 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:15:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:42,420 INFO L85 PathProgramCache]: Analyzing trace with hash -623110652, now seen corresponding path program 5 times [2022-01-19 13:15:42,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:42,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765240578] [2022-01-19 13:15:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:42,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:15:42,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765240578] [2022-01-19 13:15:42,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765240578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:42,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:42,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:15:42,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032123133] [2022-01-19 13:15:42,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:42,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:15:42,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:42,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:15:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:15:42,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:15:42,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 940 transitions, 3370 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:15:42,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:42,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:15:42,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:59,263 INFO L129 PetriNetUnfolder]: 9797/64246 cut-off events. [2022-01-19 13:15:59,263 INFO L130 PetriNetUnfolder]: For 83351/89923 co-relation queries the response was YES. [2022-01-19 13:16:00,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107357 conditions, 64246 events. 9797/64246 cut-off events. For 83351/89923 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 986947 event pairs, 5244 based on Foata normal form. 204/61268 useless extension candidates. Maximal degree in co-relation 107310. Up to 9165 conditions per place. [2022-01-19 13:16:01,142 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 215 selfloop transitions, 43 changer transitions 5/1062 dead transitions. [2022-01-19 13:16:01,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 1062 transitions, 4341 flow [2022-01-19 13:16:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:16:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:16:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5433 transitions. [2022-01-19 13:16:01,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9120362598623468 [2022-01-19 13:16:01,358 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5433 transitions. [2022-01-19 13:16:01,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5433 transitions. [2022-01-19 13:16:01,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:16:01,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5433 transitions. [2022-01-19 13:16:01,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 776.1428571428571) internal successors, (5433), 7 states have internal predecessors, (5433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:01,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:01,389 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:01,389 INFO L186 Difference]: Start difference. First operand has 848 places, 940 transitions, 3370 flow. Second operand 7 states and 5433 transitions. [2022-01-19 13:16:01,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 1062 transitions, 4341 flow [2022-01-19 13:16:01,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 1062 transitions, 4336 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 13:16:01,885 INFO L242 Difference]: Finished difference. Result has 854 places, 943 transitions, 3526 flow [2022-01-19 13:16:01,886 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3365, PETRI_DIFFERENCE_MINUEND_PLACES=843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3526, PETRI_PLACES=854, PETRI_TRANSITIONS=943} [2022-01-19 13:16:01,887 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 98 predicate places. [2022-01-19 13:16:01,888 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 943 transitions, 3526 flow [2022-01-19 13:16:01,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:01,888 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:16:01,889 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:16:01,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 13:16:01,889 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:16:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:16:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1979499548, now seen corresponding path program 6 times [2022-01-19 13:16:01,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:16:01,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467255503] [2022-01-19 13:16:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:16:01,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:16:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:16:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:16:02,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:16:02,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467255503] [2022-01-19 13:16:02,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467255503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:16:02,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:16:02,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:16:02,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446911987] [2022-01-19 13:16:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:16:02,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:16:02,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:16:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:16:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:16:02,033 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:16:02,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 943 transitions, 3526 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:02,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:16:02,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:16:02,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:16:20,034 INFO L129 PetriNetUnfolder]: 9544/62437 cut-off events. [2022-01-19 13:16:20,034 INFO L130 PetriNetUnfolder]: For 106699/113969 co-relation queries the response was YES. [2022-01-19 13:16:21,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106187 conditions, 62437 events. 9544/62437 cut-off events. For 106699/113969 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 953071 event pairs, 6147 based on Foata normal form. 125/59416 useless extension candidates. Maximal degree in co-relation 106137. Up to 11200 conditions per place. [2022-01-19 13:16:22,029 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 193 selfloop transitions, 21 changer transitions 19/1032 dead transitions. [2022-01-19 13:16:22,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 1032 transitions, 4441 flow [2022-01-19 13:16:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:16:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:16:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5380 transitions. [2022-01-19 13:16:22,034 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9031391640087292 [2022-01-19 13:16:22,034 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5380 transitions. [2022-01-19 13:16:22,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5380 transitions. [2022-01-19 13:16:22,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:16:22,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5380 transitions. [2022-01-19 13:16:22,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 768.5714285714286) internal successors, (5380), 7 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:22,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:22,044 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:22,044 INFO L186 Difference]: Start difference. First operand has 854 places, 943 transitions, 3526 flow. Second operand 7 states and 5380 transitions. [2022-01-19 13:16:22,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 1032 transitions, 4441 flow [2022-01-19 13:16:22,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 857 places, 1032 transitions, 4397 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-01-19 13:16:22,618 INFO L242 Difference]: Finished difference. Result has 861 places, 954 transitions, 3675 flow [2022-01-19 13:16:22,619 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=851, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3675, PETRI_PLACES=861, PETRI_TRANSITIONS=954} [2022-01-19 13:16:22,619 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 105 predicate places. [2022-01-19 13:16:22,619 INFO L470 AbstractCegarLoop]: Abstraction has has 861 places, 954 transitions, 3675 flow [2022-01-19 13:16:22,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:22,620 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:16:22,620 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:16:22,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 13:16:22,620 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:16:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:16:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -30601328, now seen corresponding path program 7 times [2022-01-19 13:16:22,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:16:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530130268] [2022-01-19 13:16:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:16:22,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:16:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:16:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:16:22,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:16:22,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530130268] [2022-01-19 13:16:22,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530130268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:16:22,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:16:22,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:16:22,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222486209] [2022-01-19 13:16:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:16:22,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:16:22,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:16:22,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:16:22,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:16:22,773 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:16:22,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 954 transitions, 3675 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:22,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:16:22,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:16:22,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:16:42,437 INFO L129 PetriNetUnfolder]: 11198/77159 cut-off events. [2022-01-19 13:16:42,437 INFO L130 PetriNetUnfolder]: For 116743/121649 co-relation queries the response was YES. [2022-01-19 13:16:44,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124743 conditions, 77159 events. 11198/77159 cut-off events. For 116743/121649 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 1220803 event pairs, 4495 based on Foata normal form. 366/72638 useless extension candidates. Maximal degree in co-relation 124689. Up to 6724 conditions per place. [2022-01-19 13:16:44,337 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 206 selfloop transitions, 118 changer transitions 8/1131 dead transitions. [2022-01-19 13:16:44,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 1131 transitions, 5350 flow [2022-01-19 13:16:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:16:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:16:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6961 transitions. [2022-01-19 13:16:44,343 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088653871262566 [2022-01-19 13:16:44,343 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6961 transitions. [2022-01-19 13:16:44,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6961 transitions. [2022-01-19 13:16:44,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:16:44,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6961 transitions. [2022-01-19 13:16:44,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 773.4444444444445) internal successors, (6961), 9 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:44,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:44,353 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:44,353 INFO L186 Difference]: Start difference. First operand has 861 places, 954 transitions, 3675 flow. Second operand 9 states and 6961 transitions. [2022-01-19 13:16:44,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 1131 transitions, 5350 flow [2022-01-19 13:16:45,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 868 places, 1131 transitions, 5328 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 13:16:45,012 INFO L242 Difference]: Finished difference. Result has 875 places, 1019 transitions, 4668 flow [2022-01-19 13:16:45,013 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3661, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4668, PETRI_PLACES=875, PETRI_TRANSITIONS=1019} [2022-01-19 13:16:45,013 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 119 predicate places. [2022-01-19 13:16:45,013 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 1019 transitions, 4668 flow [2022-01-19 13:16:45,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:45,014 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:16:45,014 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:16:45,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 13:16:45,014 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:16:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:16:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash 381741258, now seen corresponding path program 8 times [2022-01-19 13:16:45,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:16:45,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668051921] [2022-01-19 13:16:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:16:45,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:16:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:16:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:16:45,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:16:45,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668051921] [2022-01-19 13:16:45,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668051921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:16:45,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:16:45,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:16:45,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592884322] [2022-01-19 13:16:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:16:45,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:16:45,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:16:45,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:16:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:16:45,358 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:16:45,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 1019 transitions, 4668 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:16:45,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:16:45,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:16:45,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:17:05,395 INFO L129 PetriNetUnfolder]: 10965/74335 cut-off events. [2022-01-19 13:17:05,395 INFO L130 PetriNetUnfolder]: For 147327/152218 co-relation queries the response was YES. [2022-01-19 13:17:07,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129898 conditions, 74335 events. 10965/74335 cut-off events. For 147327/152218 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 1167604 event pairs, 4473 based on Foata normal form. 369/70322 useless extension candidates. Maximal degree in co-relation 129838. Up to 6724 conditions per place. [2022-01-19 13:17:07,682 INFO L132 encePairwiseOnDemand]: 813/851 looper letters, 173 selfloop transitions, 112 changer transitions 15/1099 dead transitions. [2022-01-19 13:17:07,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 1099 transitions, 5686 flow [2022-01-19 13:17:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 13:17:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 13:17:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6164 transitions. [2022-01-19 13:17:07,688 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2022-01-19 13:17:07,688 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6164 transitions. [2022-01-19 13:17:07,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6164 transitions. [2022-01-19 13:17:07,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:17:07,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6164 transitions. [2022-01-19 13:17:07,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 770.5) internal successors, (6164), 8 states have internal predecessors, (6164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:07,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:07,697 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:07,697 INFO L186 Difference]: Start difference. First operand has 875 places, 1019 transitions, 4668 flow. Second operand 8 states and 6164 transitions. [2022-01-19 13:17:07,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 1099 transitions, 5686 flow [2022-01-19 13:17:08,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 1099 transitions, 5676 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-01-19 13:17:08,847 INFO L242 Difference]: Finished difference. Result has 883 places, 1019 transitions, 5032 flow [2022-01-19 13:17:08,848 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4650, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5032, PETRI_PLACES=883, PETRI_TRANSITIONS=1019} [2022-01-19 13:17:08,848 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 127 predicate places. [2022-01-19 13:17:08,848 INFO L470 AbstractCegarLoop]: Abstraction has has 883 places, 1019 transitions, 5032 flow [2022-01-19 13:17:08,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:08,849 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:17:08,849 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:17:08,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 13:17:08,849 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:17:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:17:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1027995298, now seen corresponding path program 9 times [2022-01-19 13:17:08,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:17:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736356579] [2022-01-19 13:17:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:17:08,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:17:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:17:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:17:08,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:17:08,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736356579] [2022-01-19 13:17:08,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736356579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:17:08,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:17:08,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:17:08,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457031161] [2022-01-19 13:17:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:17:08,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:17:08,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:17:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:17:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:17:08,978 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:17:08,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 1019 transitions, 5032 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:08,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:17:08,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:17:08,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:17:28,050 INFO L129 PetriNetUnfolder]: 10542/70042 cut-off events. [2022-01-19 13:17:28,050 INFO L130 PetriNetUnfolder]: For 180239/184855 co-relation queries the response was YES. [2022-01-19 13:17:29,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128298 conditions, 70042 events. 10542/70042 cut-off events. For 180239/184855 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 1089748 event pairs, 5498 based on Foata normal form. 274/66358 useless extension candidates. Maximal degree in co-relation 128234. Up to 8619 conditions per place. [2022-01-19 13:17:30,554 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 210 selfloop transitions, 50 changer transitions 14/1073 dead transitions. [2022-01-19 13:17:30,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 1073 transitions, 5819 flow [2022-01-19 13:17:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:17:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:17:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4632 transitions. [2022-01-19 13:17:30,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9071680376028202 [2022-01-19 13:17:30,557 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4632 transitions. [2022-01-19 13:17:30,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4632 transitions. [2022-01-19 13:17:30,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:17:30,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4632 transitions. [2022-01-19 13:17:30,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 772.0) internal successors, (4632), 6 states have internal predecessors, (4632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:30,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:30,562 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:30,562 INFO L186 Difference]: Start difference. First operand has 883 places, 1019 transitions, 5032 flow. Second operand 6 states and 4632 transitions. [2022-01-19 13:17:30,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 1073 transitions, 5819 flow [2022-01-19 13:17:32,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 1073 transitions, 5638 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-01-19 13:17:32,109 INFO L242 Difference]: Finished difference. Result has 886 places, 1018 transitions, 4977 flow [2022-01-19 13:17:32,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4802, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4977, PETRI_PLACES=886, PETRI_TRANSITIONS=1018} [2022-01-19 13:17:32,110 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 130 predicate places. [2022-01-19 13:17:32,110 INFO L470 AbstractCegarLoop]: Abstraction has has 886 places, 1018 transitions, 4977 flow [2022-01-19 13:17:32,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:32,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:17:32,111 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:17:32,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 13:17:32,111 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:17:32,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:17:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1379995286, now seen corresponding path program 1 times [2022-01-19 13:17:32,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:17:32,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811786875] [2022-01-19 13:17:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:17:32,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:17:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:17:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:17:32,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:17:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811786875] [2022-01-19 13:17:32,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811786875] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:17:32,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:17:32,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:17:32,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473501438] [2022-01-19 13:17:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:17:32,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:17:32,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:17:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:17:32,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:17:32,240 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 851 [2022-01-19 13:17:32,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 1018 transitions, 4977 flow. Second operand has 7 states, 7 states have (on average 742.4285714285714) internal successors, (5197), 7 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:17:32,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:17:32,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 851 [2022-01-19 13:17:32,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:17:49,915 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), 253#L96-14true, Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:49,918 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2022-01-19 13:17:49,918 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 13:17:49,918 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 13:17:49,918 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 13:17:50,217 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:50,217 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-01-19 13:17:50,217 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 13:17:50,218 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 13:17:50,218 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 13:17:50,505 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 606#L96-16true, Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:50,506 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-01-19 13:17:50,506 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 13:17:50,506 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 13:17:50,506 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 13:17:53,267 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), 680#L160-2true, Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:53,267 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-01-19 13:17:53,267 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 13:17:53,267 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 13:17:53,267 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 13:17:53,587 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 253#L96-14true, Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:53,587 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2022-01-19 13:17:53,587 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 13:17:53,587 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 13:17:53,587 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 13:17:53,587 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 13:17:53,898 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:53,898 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-01-19 13:17:53,898 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 13:17:53,898 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 13:17:53,898 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 13:17:53,898 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 13:17:54,204 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 606#L96-16true, Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:54,204 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-01-19 13:17:54,205 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 13:17:54,205 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 13:17:54,205 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 13:17:54,205 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 13:17:57,022 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), 680#L160-2true, Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:17:57,022 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-01-19 13:17:57,022 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 13:17:57,022 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 13:17:57,022 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 13:17:57,022 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 13:18:23,404 INFO L129 PetriNetUnfolder]: 35999/188452 cut-off events. [2022-01-19 13:18:23,404 INFO L130 PetriNetUnfolder]: For 140435/151291 co-relation queries the response was YES. [2022-01-19 13:18:27,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263519 conditions, 188452 events. 35999/188452 cut-off events. For 140435/151291 co-relation queries the response was YES. Maximal size of possible extension queue 3111. Compared 3175488 event pairs, 15632 based on Foata normal form. 300/167831 useless extension candidates. Maximal degree in co-relation 263454. Up to 31354 conditions per place. [2022-01-19 13:18:28,493 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 129 selfloop transitions, 5 changer transitions 4/1085 dead transitions. [2022-01-19 13:18:28,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 1085 transitions, 5403 flow [2022-01-19 13:18:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 13:18:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 13:18:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6026 transitions. [2022-01-19 13:18:28,496 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851351351351351 [2022-01-19 13:18:28,496 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6026 transitions. [2022-01-19 13:18:28,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6026 transitions. [2022-01-19 13:18:28,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:18:28,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6026 transitions. [2022-01-19 13:18:28,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 753.25) internal successors, (6026), 8 states have internal predecessors, (6026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:18:28,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:18:28,505 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:18:28,505 INFO L186 Difference]: Start difference. First operand has 886 places, 1018 transitions, 4977 flow. Second operand 8 states and 6026 transitions. [2022-01-19 13:18:28,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 1085 transitions, 5403 flow [2022-01-19 13:18:30,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 892 places, 1085 transitions, 5344 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 13:18:30,119 INFO L242 Difference]: Finished difference. Result has 897 places, 1020 transitions, 4947 flow [2022-01-19 13:18:30,120 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4918, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4947, PETRI_PLACES=897, PETRI_TRANSITIONS=1020} [2022-01-19 13:18:30,120 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 141 predicate places. [2022-01-19 13:18:30,120 INFO L470 AbstractCegarLoop]: Abstraction has has 897 places, 1020 transitions, 4947 flow [2022-01-19 13:18:30,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 742.4285714285714) internal successors, (5197), 7 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:18:30,121 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:18:30,121 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:18:30,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 13:18:30,121 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:18:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:18:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash -674811482, now seen corresponding path program 1 times [2022-01-19 13:18:30,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:18:30,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245009034] [2022-01-19 13:18:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:18:30,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:18:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:18:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:18:30,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:18:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245009034] [2022-01-19 13:18:30,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245009034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:18:30,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:18:30,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:18:30,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962409256] [2022-01-19 13:18:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:18:30,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:18:30,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:18:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:18:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:18:30,232 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 851 [2022-01-19 13:18:30,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 1020 transitions, 4947 flow. Second operand has 8 states, 8 states have (on average 738.875) internal successors, (5911), 8 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:18:30,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:18:30,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 851 [2022-01-19 13:18:30,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:18:46,726 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6318#(= ~break_17~0 0), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:18:46,726 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-01-19 13:18:46,726 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 13:18:46,727 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 13:18:46,727 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 13:18:49,839 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 680#L160-2true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6318#(= ~break_17~0 0), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:18:49,840 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-01-19 13:18:49,840 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 13:18:49,840 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 13:18:49,840 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 13:18:50,507 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:18:50,508 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-01-19 13:18:50,508 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 13:18:50,508 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 13:18:50,508 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 13:18:50,508 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 13:18:53,845 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), 680#L160-2true, Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 13:18:53,846 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-01-19 13:18:53,846 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 13:18:53,846 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 13:18:53,846 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 13:18:53,846 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 13:19:27,945 INFO L129 PetriNetUnfolder]: 43180/195755 cut-off events. [2022-01-19 13:19:27,945 INFO L130 PetriNetUnfolder]: For 138591/158791 co-relation queries the response was YES. [2022-01-19 13:19:32,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 291251 conditions, 195755 events. 43180/195755 cut-off events. For 138591/158791 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 3241485 event pairs, 14598 based on Foata normal form. 406/176212 useless extension candidates. Maximal degree in co-relation 291181. Up to 29037 conditions per place. [2022-01-19 13:19:33,501 INFO L132 encePairwiseOnDemand]: 841/851 looper letters, 167 selfloop transitions, 7 changer transitions 9/1128 dead transitions. [2022-01-19 13:19:33,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 1128 transitions, 5566 flow [2022-01-19 13:19:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 13:19:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 13:19:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 7512 transitions. [2022-01-19 13:19:33,505 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827262044653349 [2022-01-19 13:19:33,506 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 7512 transitions. [2022-01-19 13:19:33,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 7512 transitions. [2022-01-19 13:19:33,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:19:33,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 7512 transitions. [2022-01-19 13:19:33,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 751.2) internal successors, (7512), 10 states have internal predecessors, (7512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:33,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 851.0) internal successors, (9361), 11 states have internal predecessors, (9361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:33,518 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 851.0) internal successors, (9361), 11 states have internal predecessors, (9361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:33,518 INFO L186 Difference]: Start difference. First operand has 897 places, 1020 transitions, 4947 flow. Second operand 10 states and 7512 transitions. [2022-01-19 13:19:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 1128 transitions, 5566 flow [2022-01-19 13:19:35,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 1128 transitions, 5555 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-19 13:19:35,565 INFO L242 Difference]: Finished difference. Result has 907 places, 1024 transitions, 4983 flow [2022-01-19 13:19:35,566 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4938, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4983, PETRI_PLACES=907, PETRI_TRANSITIONS=1024} [2022-01-19 13:19:35,566 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 151 predicate places. [2022-01-19 13:19:35,566 INFO L470 AbstractCegarLoop]: Abstraction has has 907 places, 1024 transitions, 4983 flow [2022-01-19 13:19:35,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 738.875) internal successors, (5911), 8 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:35,567 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:19:35,568 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:19:35,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 13:19:35,569 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:19:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:19:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2042486976, now seen corresponding path program 1 times [2022-01-19 13:19:35,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:19:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026564343] [2022-01-19 13:19:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:19:35,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:19:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:19:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:19:35,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:19:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026564343] [2022-01-19 13:19:35,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026564343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:19:35,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:19:35,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:19:35,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988023630] [2022-01-19 13:19:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:19:35,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:19:35,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:19:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:19:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:19:35,659 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:19:35,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 1024 transitions, 4983 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:35,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:19:35,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:19:35,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:19:43,870 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2686] thread1EXIT-->L159-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem112#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem112#1=|v_ULTIMATE.start_main_#t~mem112#1_5|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem112#1=|v_ULTIMATE.start_main_#t~mem112#1_5|} AuxVars[] AssignedVars[][972], [Black: 6516#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|) (<= 1005 ~result_18~0)), Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6512#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite84#1|) (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|)), Black: 6387#(<= (+ ~result_12~0 995) 0), Black: 6523#(and (<= 1005 ~result_18~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6521#(and (<= 1005 ~result_18~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6503#true, Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 6537#(and (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), 487#L123-4true, Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 498#L96-4true, Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0), Black: 6507#(<= 1005 ~result_18~0), Black: 6514#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite84#1|) (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|) (<= 1005 ~result_18~0))]) [2022-01-19 13:19:43,870 INFO L384 tUnfolder$Statistics]: this new event has 383 ancestors and is cut-off event [2022-01-19 13:19:43,870 INFO L387 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-01-19 13:19:43,870 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2022-01-19 13:19:43,870 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2022-01-19 13:19:46,776 INFO L129 PetriNetUnfolder]: 4018/39684 cut-off events. [2022-01-19 13:19:46,776 INFO L130 PetriNetUnfolder]: For 117653/124569 co-relation queries the response was YES. [2022-01-19 13:19:47,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76394 conditions, 39684 events. 4018/39684 cut-off events. For 117653/124569 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 567835 event pairs, 1094 based on Foata normal form. 230/37513 useless extension candidates. Maximal degree in co-relation 76319. Up to 2163 conditions per place. [2022-01-19 13:19:47,753 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 92 selfloop transitions, 27 changer transitions 34/1069 dead transitions. [2022-01-19 13:19:47,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 1069 transitions, 5623 flow [2022-01-19 13:19:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:19:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:19:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3990 transitions. [2022-01-19 13:19:47,755 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9377203290246768 [2022-01-19 13:19:47,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3990 transitions. [2022-01-19 13:19:47,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3990 transitions. [2022-01-19 13:19:47,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:19:47,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3990 transitions. [2022-01-19 13:19:47,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 798.0) internal successors, (3990), 5 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:47,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:47,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:47,760 INFO L186 Difference]: Start difference. First operand has 907 places, 1024 transitions, 4983 flow. Second operand 5 states and 3990 transitions. [2022-01-19 13:19:47,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 1069 transitions, 5623 flow [2022-01-19 13:19:48,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1069 transitions, 5614 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-01-19 13:19:48,671 INFO L242 Difference]: Finished difference. Result has 908 places, 1010 transitions, 4784 flow [2022-01-19 13:19:48,672 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4974, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4784, PETRI_PLACES=908, PETRI_TRANSITIONS=1010} [2022-01-19 13:19:48,673 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 152 predicate places. [2022-01-19 13:19:48,673 INFO L470 AbstractCegarLoop]: Abstraction has has 908 places, 1010 transitions, 4784 flow [2022-01-19 13:19:48,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:48,673 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:19:48,673 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:19:48,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 13:19:48,674 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:19:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:19:48,674 INFO L85 PathProgramCache]: Analyzing trace with hash 654373954, now seen corresponding path program 2 times [2022-01-19 13:19:48,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:19:48,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835793992] [2022-01-19 13:19:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:19:48,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:19:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:19:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:19:48,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:19:48,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835793992] [2022-01-19 13:19:48,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835793992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:19:48,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:19:48,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:19:48,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746341089] [2022-01-19 13:19:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:19:48,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:19:48,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:19:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:19:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:19:48,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:19:48,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 1010 transitions, 4784 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:48,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:19:48,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:19:48,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:19:58,652 INFO L129 PetriNetUnfolder]: 3510/33096 cut-off events. [2022-01-19 13:19:58,652 INFO L130 PetriNetUnfolder]: For 146259/157774 co-relation queries the response was YES. [2022-01-19 13:19:59,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69504 conditions, 33096 events. 3510/33096 cut-off events. For 146259/157774 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 467131 event pairs, 597 based on Foata normal form. 606/31882 useless extension candidates. Maximal degree in co-relation 69428. Up to 1479 conditions per place. [2022-01-19 13:19:59,638 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 118 selfloop transitions, 46 changer transitions 13/1093 dead transitions. [2022-01-19 13:19:59,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 1093 transitions, 6219 flow [2022-01-19 13:19:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:19:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:19:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2022-01-19 13:19:59,640 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2022-01-19 13:19:59,640 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2022-01-19 13:19:59,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2022-01-19 13:19:59,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:19:59,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2022-01-19 13:19:59,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 801.2) internal successors, (4006), 5 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:59,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:59,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:19:59,646 INFO L186 Difference]: Start difference. First operand has 908 places, 1010 transitions, 4784 flow. Second operand 5 states and 4006 transitions. [2022-01-19 13:19:59,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 1093 transitions, 6219 flow [2022-01-19 13:20:00,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1093 transitions, 6061 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-01-19 13:20:00,665 INFO L242 Difference]: Finished difference. Result has 909 places, 1034 transitions, 5380 flow [2022-01-19 13:20:00,666 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4684, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5380, PETRI_PLACES=909, PETRI_TRANSITIONS=1034} [2022-01-19 13:20:00,667 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 153 predicate places. [2022-01-19 13:20:00,667 INFO L470 AbstractCegarLoop]: Abstraction has has 909 places, 1034 transitions, 5380 flow [2022-01-19 13:20:00,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:00,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:20:00,668 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:20:00,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 13:20:00,668 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:20:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:20:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash -203898288, now seen corresponding path program 3 times [2022-01-19 13:20:00,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:20:00,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864635697] [2022-01-19 13:20:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:20:00,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:20:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:20:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:20:00,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:20:00,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864635697] [2022-01-19 13:20:00,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864635697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:20:00,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:20:00,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:20:00,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930044567] [2022-01-19 13:20:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:20:00,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:20:00,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:20:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:20:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:20:00,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:20:00,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 1034 transitions, 5380 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:00,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:20:00,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:20:00,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:20:12,906 INFO L129 PetriNetUnfolder]: 3917/40555 cut-off events. [2022-01-19 13:20:12,906 INFO L130 PetriNetUnfolder]: For 152315/167837 co-relation queries the response was YES. [2022-01-19 13:20:13,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77886 conditions, 40555 events. 3917/40555 cut-off events. For 152315/167837 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 586792 event pairs, 740 based on Foata normal form. 1034/39172 useless extension candidates. Maximal degree in co-relation 77810. Up to 1530 conditions per place. [2022-01-19 13:20:14,041 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 140 selfloop transitions, 49 changer transitions 24/1129 dead transitions. [2022-01-19 13:20:14,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 1129 transitions, 7081 flow [2022-01-19 13:20:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:20:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:20:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4010 transitions. [2022-01-19 13:20:14,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9424206815511164 [2022-01-19 13:20:14,044 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4010 transitions. [2022-01-19 13:20:14,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4010 transitions. [2022-01-19 13:20:14,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:20:14,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4010 transitions. [2022-01-19 13:20:14,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:14,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:14,048 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:14,048 INFO L186 Difference]: Start difference. First operand has 909 places, 1034 transitions, 5380 flow. Second operand 5 states and 4010 transitions. [2022-01-19 13:20:14,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 1129 transitions, 7081 flow [2022-01-19 13:20:14,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 1129 transitions, 7075 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-01-19 13:20:14,984 INFO L242 Difference]: Finished difference. Result has 917 places, 1051 transitions, 5927 flow [2022-01-19 13:20:14,985 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=5376, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5927, PETRI_PLACES=917, PETRI_TRANSITIONS=1051} [2022-01-19 13:20:14,985 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 161 predicate places. [2022-01-19 13:20:14,986 INFO L470 AbstractCegarLoop]: Abstraction has has 917 places, 1051 transitions, 5927 flow [2022-01-19 13:20:14,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:14,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:20:14,986 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:20:14,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 13:20:14,986 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:20:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:20:14,987 INFO L85 PathProgramCache]: Analyzing trace with hash 582216258, now seen corresponding path program 4 times [2022-01-19 13:20:14,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:20:14,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785268655] [2022-01-19 13:20:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:20:14,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:20:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:20:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:20:15,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:20:15,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785268655] [2022-01-19 13:20:15,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785268655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:20:15,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:20:15,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:20:15,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994041748] [2022-01-19 13:20:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:20:15,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:20:15,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:20:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:20:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:20:15,080 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:20:15,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 1051 transitions, 5927 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:15,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:20:15,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:20:15,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:20:26,857 INFO L129 PetriNetUnfolder]: 3729/38781 cut-off events. [2022-01-19 13:20:26,857 INFO L130 PetriNetUnfolder]: For 164374/182131 co-relation queries the response was YES. [2022-01-19 13:20:27,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77305 conditions, 38781 events. 3729/38781 cut-off events. For 164374/182131 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 556581 event pairs, 718 based on Foata normal form. 525/37031 useless extension candidates. Maximal degree in co-relation 77225. Up to 1395 conditions per place. [2022-01-19 13:20:27,757 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 126 selfloop transitions, 40 changer transitions 2/1084 dead transitions. [2022-01-19 13:20:27,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 1084 transitions, 6434 flow [2022-01-19 13:20:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:20:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:20:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3200 transitions. [2022-01-19 13:20:27,759 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9400705052878966 [2022-01-19 13:20:27,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3200 transitions. [2022-01-19 13:20:27,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3200 transitions. [2022-01-19 13:20:27,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:20:27,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3200 transitions. [2022-01-19 13:20:27,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 800.0) internal successors, (3200), 4 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:27,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:27,763 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:27,763 INFO L186 Difference]: Start difference. First operand has 917 places, 1051 transitions, 5927 flow. Second operand 4 states and 3200 transitions. [2022-01-19 13:20:27,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 1084 transitions, 6434 flow [2022-01-19 13:20:28,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 1084 transitions, 6388 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-01-19 13:20:28,559 INFO L242 Difference]: Finished difference. Result has 921 places, 1052 transitions, 6041 flow [2022-01-19 13:20:28,560 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=5884, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6041, PETRI_PLACES=921, PETRI_TRANSITIONS=1052} [2022-01-19 13:20:28,561 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 165 predicate places. [2022-01-19 13:20:28,561 INFO L470 AbstractCegarLoop]: Abstraction has has 921 places, 1052 transitions, 6041 flow [2022-01-19 13:20:28,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:28,561 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:20:28,562 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:20:28,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 13:20:28,562 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:20:28,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:20:28,562 INFO L85 PathProgramCache]: Analyzing trace with hash 499597566, now seen corresponding path program 1 times [2022-01-19 13:20:28,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:20:28,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299675643] [2022-01-19 13:20:28,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:20:28,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:20:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:20:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:20:28,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:20:28,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299675643] [2022-01-19 13:20:28,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299675643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:20:28,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:20:28,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:20:28,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648635859] [2022-01-19 13:20:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:20:28,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:20:28,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:20:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:20:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:20:28,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:20:28,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 1052 transitions, 6041 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:28,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:20:28,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:20:28,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:20:40,521 INFO L129 PetriNetUnfolder]: 3902/39029 cut-off events. [2022-01-19 13:20:40,521 INFO L130 PetriNetUnfolder]: For 176578/191838 co-relation queries the response was YES. [2022-01-19 13:20:41,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78936 conditions, 39029 events. 3902/39029 cut-off events. For 176578/191838 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 559885 event pairs, 720 based on Foata normal form. 660/37406 useless extension candidates. Maximal degree in co-relation 78855. Up to 1390 conditions per place. [2022-01-19 13:20:41,427 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 143 selfloop transitions, 30 changer transitions 20/1109 dead transitions. [2022-01-19 13:20:41,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 1109 transitions, 7261 flow [2022-01-19 13:20:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:20:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:20:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3201 transitions. [2022-01-19 13:20:41,429 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9403642773207991 [2022-01-19 13:20:41,429 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3201 transitions. [2022-01-19 13:20:41,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3201 transitions. [2022-01-19 13:20:41,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:20:41,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3201 transitions. [2022-01-19 13:20:41,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 800.25) internal successors, (3201), 4 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:41,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:41,433 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:41,433 INFO L186 Difference]: Start difference. First operand has 921 places, 1052 transitions, 6041 flow. Second operand 4 states and 3201 transitions. [2022-01-19 13:20:41,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 1109 transitions, 7261 flow [2022-01-19 13:20:42,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 1109 transitions, 7257 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-01-19 13:20:42,240 INFO L242 Difference]: Finished difference. Result has 927 places, 1055 transitions, 6225 flow [2022-01-19 13:20:42,241 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6225, PETRI_PLACES=927, PETRI_TRANSITIONS=1055} [2022-01-19 13:20:42,241 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 171 predicate places. [2022-01-19 13:20:42,241 INFO L470 AbstractCegarLoop]: Abstraction has has 927 places, 1055 transitions, 6225 flow [2022-01-19 13:20:42,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:42,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:20:42,242 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:20:42,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 13:20:42,242 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:20:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:20:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -712975400, now seen corresponding path program 2 times [2022-01-19 13:20:42,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:20:42,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480895708] [2022-01-19 13:20:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:20:42,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:20:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:20:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:20:42,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:20:42,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480895708] [2022-01-19 13:20:42,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480895708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:20:42,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:20:42,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:20:42,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835512378] [2022-01-19 13:20:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:20:42,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:20:42,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:20:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:20:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:20:42,515 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:20:42,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 1055 transitions, 6225 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:42,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:20:42,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:20:42,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:20:56,403 INFO L129 PetriNetUnfolder]: 4182/46385 cut-off events. [2022-01-19 13:20:56,404 INFO L130 PetriNetUnfolder]: For 218429/235687 co-relation queries the response was YES. [2022-01-19 13:20:57,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87731 conditions, 46385 events. 4182/46385 cut-off events. For 218429/235687 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 680463 event pairs, 1029 based on Foata normal form. 506/44034 useless extension candidates. Maximal degree in co-relation 87647. Up to 2472 conditions per place. [2022-01-19 13:20:57,820 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 129 selfloop transitions, 40 changer transitions 11/1096 dead transitions. [2022-01-19 13:20:57,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 1096 transitions, 6818 flow [2022-01-19 13:20:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:20:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:20:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3991 transitions. [2022-01-19 13:20:57,823 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379553466509988 [2022-01-19 13:20:57,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3991 transitions. [2022-01-19 13:20:57,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3991 transitions. [2022-01-19 13:20:57,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:20:57,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3991 transitions. [2022-01-19 13:20:57,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 798.2) internal successors, (3991), 5 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:57,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:57,829 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:57,829 INFO L186 Difference]: Start difference. First operand has 927 places, 1055 transitions, 6225 flow. Second operand 5 states and 3991 transitions. [2022-01-19 13:20:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 1096 transitions, 6818 flow [2022-01-19 13:20:58,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 1096 transitions, 6818 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:20:58,940 INFO L242 Difference]: Finished difference. Result has 934 places, 1057 transitions, 6376 flow [2022-01-19 13:20:58,941 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6376, PETRI_PLACES=934, PETRI_TRANSITIONS=1057} [2022-01-19 13:20:58,941 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 178 predicate places. [2022-01-19 13:20:58,941 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 1057 transitions, 6376 flow [2022-01-19 13:20:58,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:58,941 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:20:58,942 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:20:58,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 13:20:58,942 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:20:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:20:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 862920256, now seen corresponding path program 3 times [2022-01-19 13:20:58,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:20:58,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595406040] [2022-01-19 13:20:58,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:20:58,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:20:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:20:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:20:59,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:20:59,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595406040] [2022-01-19 13:20:59,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595406040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:20:59,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:20:59,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:20:59,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230439640] [2022-01-19 13:20:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:20:59,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:20:59,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:20:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:20:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:20:59,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:20:59,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 1057 transitions, 6376 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:20:59,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:20:59,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:20:59,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:21:12,376 INFO L129 PetriNetUnfolder]: 3761/42128 cut-off events. [2022-01-19 13:21:12,377 INFO L130 PetriNetUnfolder]: For 248281/268563 co-relation queries the response was YES. [2022-01-19 13:21:13,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83972 conditions, 42128 events. 3761/42128 cut-off events. For 248281/268563 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 618743 event pairs, 1037 based on Foata normal form. 487/40193 useless extension candidates. Maximal degree in co-relation 83884. Up to 2209 conditions per place. [2022-01-19 13:21:13,741 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 115 selfloop transitions, 49 changer transitions 13/1093 dead transitions. [2022-01-19 13:21:13,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 1093 transitions, 6915 flow [2022-01-19 13:21:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:21:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:21:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2022-01-19 13:21:13,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2022-01-19 13:21:13,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2022-01-19 13:21:13,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2022-01-19 13:21:13,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:21:13,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2022-01-19 13:21:13,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 797.8) internal successors, (3989), 5 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:13,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:13,747 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:13,748 INFO L186 Difference]: Start difference. First operand has 934 places, 1057 transitions, 6376 flow. Second operand 5 states and 3989 transitions. [2022-01-19 13:21:13,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 1093 transitions, 6915 flow [2022-01-19 13:21:14,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 1093 transitions, 6837 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 13:21:14,990 INFO L242 Difference]: Finished difference. Result has 939 places, 1057 transitions, 6437 flow [2022-01-19 13:21:14,991 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6298, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6437, PETRI_PLACES=939, PETRI_TRANSITIONS=1057} [2022-01-19 13:21:14,991 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 183 predicate places. [2022-01-19 13:21:14,991 INFO L470 AbstractCegarLoop]: Abstraction has has 939 places, 1057 transitions, 6437 flow [2022-01-19 13:21:14,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:14,991 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:21:14,991 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:21:14,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 13:21:14,992 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:21:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:21:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1232968302, now seen corresponding path program 4 times [2022-01-19 13:21:14,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:21:14,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618255176] [2022-01-19 13:21:14,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:21:14,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:21:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:21:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:21:15,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:21:15,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618255176] [2022-01-19 13:21:15,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618255176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:21:15,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:21:15,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:21:15,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960857329] [2022-01-19 13:21:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:21:15,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:21:15,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:21:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:21:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:21:15,077 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:21:15,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 1057 transitions, 6437 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:15,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:21:15,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:21:15,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:21:27,642 INFO L129 PetriNetUnfolder]: 3519/37563 cut-off events. [2022-01-19 13:21:27,643 INFO L130 PetriNetUnfolder]: For 274958/302299 co-relation queries the response was YES. [2022-01-19 13:21:28,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80098 conditions, 37563 events. 3519/37563 cut-off events. For 274958/302299 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 547857 event pairs, 547 based on Foata normal form. 1497/37049 useless extension candidates. Maximal degree in co-relation 80007. Up to 1472 conditions per place. [2022-01-19 13:21:29,177 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 164 selfloop transitions, 48 changer transitions 15/1143 dead transitions. [2022-01-19 13:21:29,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 1143 transitions, 7983 flow [2022-01-19 13:21:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:21:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:21:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4002 transitions. [2022-01-19 13:21:29,180 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2022-01-19 13:21:29,180 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4002 transitions. [2022-01-19 13:21:29,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4002 transitions. [2022-01-19 13:21:29,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:21:29,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4002 transitions. [2022-01-19 13:21:29,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 800.4) internal successors, (4002), 5 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:29,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:29,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:29,187 INFO L186 Difference]: Start difference. First operand has 939 places, 1057 transitions, 6437 flow. Second operand 5 states and 4002 transitions. [2022-01-19 13:21:29,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 1143 transitions, 7983 flow [2022-01-19 13:21:30,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 1143 transitions, 7889 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 13:21:30,253 INFO L242 Difference]: Finished difference. Result has 944 places, 1076 transitions, 6963 flow [2022-01-19 13:21:30,253 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6353, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6963, PETRI_PLACES=944, PETRI_TRANSITIONS=1076} [2022-01-19 13:21:30,254 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 188 predicate places. [2022-01-19 13:21:30,254 INFO L470 AbstractCegarLoop]: Abstraction has has 944 places, 1076 transitions, 6963 flow [2022-01-19 13:21:30,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:30,254 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:21:30,254 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:21:30,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 13:21:30,254 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:21:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:21:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash 13610576, now seen corresponding path program 5 times [2022-01-19 13:21:30,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:21:30,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391159136] [2022-01-19 13:21:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:21:30,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:21:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:21:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:21:30,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:21:30,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391159136] [2022-01-19 13:21:30,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391159136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:21:30,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:21:30,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:21:30,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662640813] [2022-01-19 13:21:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:21:30,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:21:30,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:21:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:21:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:21:30,343 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:21:30,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 1076 transitions, 6963 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:30,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:21:30,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:21:30,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:21:44,370 INFO L129 PetriNetUnfolder]: 3835/42373 cut-off events. [2022-01-19 13:21:44,370 INFO L130 PetriNetUnfolder]: For 285346/313489 co-relation queries the response was YES. [2022-01-19 13:21:45,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85507 conditions, 42373 events. 3835/42373 cut-off events. For 285346/313489 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 618626 event pairs, 651 based on Foata normal form. 1604/41539 useless extension candidates. Maximal degree in co-relation 85413. Up to 1447 conditions per place. [2022-01-19 13:21:46,010 INFO L132 encePairwiseOnDemand]: 839/851 looper letters, 165 selfloop transitions, 57 changer transitions 9/1147 dead transitions. [2022-01-19 13:21:46,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1147 transitions, 8095 flow [2022-01-19 13:21:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:21:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:21:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2022-01-19 13:21:46,013 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2022-01-19 13:21:46,013 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2022-01-19 13:21:46,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2022-01-19 13:21:46,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:21:46,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2022-01-19 13:21:46,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 801.2) internal successors, (4006), 5 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:46,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:46,019 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:46,019 INFO L186 Difference]: Start difference. First operand has 944 places, 1076 transitions, 6963 flow. Second operand 5 states and 4006 transitions. [2022-01-19 13:21:46,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1147 transitions, 8095 flow [2022-01-19 13:21:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 1147 transitions, 8069 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-01-19 13:21:47,213 INFO L242 Difference]: Finished difference. Result has 952 places, 1088 transitions, 7398 flow [2022-01-19 13:21:47,214 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6887, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7398, PETRI_PLACES=952, PETRI_TRANSITIONS=1088} [2022-01-19 13:21:47,215 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 196 predicate places. [2022-01-19 13:21:47,215 INFO L470 AbstractCegarLoop]: Abstraction has has 952 places, 1088 transitions, 7398 flow [2022-01-19 13:21:47,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:47,216 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:21:47,216 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:21:47,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 13:21:47,216 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:21:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:21:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 993155130, now seen corresponding path program 6 times [2022-01-19 13:21:47,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:21:47,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035544070] [2022-01-19 13:21:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:21:47,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:21:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:21:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:21:47,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:21:47,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035544070] [2022-01-19 13:21:47,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035544070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:21:47,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:21:47,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:21:47,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214645217] [2022-01-19 13:21:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:21:47,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:21:47,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:21:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:21:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:21:47,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:21:47,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 1088 transitions, 7398 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:21:47,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:21:47,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:21:47,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:01,729 INFO L129 PetriNetUnfolder]: 3828/41448 cut-off events. [2022-01-19 13:22:01,729 INFO L130 PetriNetUnfolder]: For 319949/350046 co-relation queries the response was YES. [2022-01-19 13:22:03,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85690 conditions, 41448 events. 3828/41448 cut-off events. For 319949/350046 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 601600 event pairs, 948 based on Foata normal form. 1394/40439 useless extension candidates. Maximal degree in co-relation 85592. Up to 2399 conditions per place. [2022-01-19 13:22:03,662 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 46 changer transitions 6/1123 dead transitions. [2022-01-19 13:22:03,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 1123 transitions, 8034 flow [2022-01-19 13:22:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:22:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:22:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2022-01-19 13:22:03,665 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2022-01-19 13:22:03,665 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2022-01-19 13:22:03,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2022-01-19 13:22:03,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:03,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2022-01-19 13:22:03,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 799.75) internal successors, (3199), 4 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:03,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:03,670 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:03,670 INFO L186 Difference]: Start difference. First operand has 952 places, 1088 transitions, 7398 flow. Second operand 4 states and 3199 transitions. [2022-01-19 13:22:03,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 1123 transitions, 8034 flow [2022-01-19 13:22:05,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 1123 transitions, 7985 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 13:22:05,172 INFO L242 Difference]: Finished difference. Result has 954 places, 1087 transitions, 7422 flow [2022-01-19 13:22:05,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7330, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7422, PETRI_PLACES=954, PETRI_TRANSITIONS=1087} [2022-01-19 13:22:05,173 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 198 predicate places. [2022-01-19 13:22:05,173 INFO L470 AbstractCegarLoop]: Abstraction has has 954 places, 1087 transitions, 7422 flow [2022-01-19 13:22:05,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:05,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:05,174 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:22:05,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 13:22:05,174 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:22:05,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1985037212, now seen corresponding path program 5 times [2022-01-19 13:22:05,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:05,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014776107] [2022-01-19 13:22:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:05,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:22:05,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:05,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014776107] [2022-01-19 13:22:05,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014776107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:05,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:05,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:22:05,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187885129] [2022-01-19 13:22:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:05,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:22:05,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:05,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:22:05,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:22:05,258 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:22:05,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 1087 transitions, 7422 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:05,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:05,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:22:05,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:21,273 INFO L129 PetriNetUnfolder]: 4217/47713 cut-off events. [2022-01-19 13:22:21,273 INFO L130 PetriNetUnfolder]: For 323729/350891 co-relation queries the response was YES. [2022-01-19 13:22:22,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93396 conditions, 47713 events. 4217/47713 cut-off events. For 323729/350891 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 702743 event pairs, 1043 based on Foata normal form. 429/45246 useless extension candidates. Maximal degree in co-relation 93297. Up to 2748 conditions per place. [2022-01-19 13:22:22,952 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 165 selfloop transitions, 27 changer transitions 17/1125 dead transitions. [2022-01-19 13:22:22,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 1125 transitions, 8035 flow [2022-01-19 13:22:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:22:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:22:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2022-01-19 13:22:22,955 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2022-01-19 13:22:22,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2022-01-19 13:22:22,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2022-01-19 13:22:22,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:22,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2022-01-19 13:22:22,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 797.8) internal successors, (3989), 5 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:22,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:22,959 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:22,960 INFO L186 Difference]: Start difference. First operand has 954 places, 1087 transitions, 7422 flow. Second operand 5 states and 3989 transitions. [2022-01-19 13:22:22,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 1125 transitions, 8035 flow [2022-01-19 13:22:24,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 1125 transitions, 8001 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:22:24,408 INFO L242 Difference]: Finished difference. Result has 959 places, 1085 transitions, 7379 flow [2022-01-19 13:22:24,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7388, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7379, PETRI_PLACES=959, PETRI_TRANSITIONS=1085} [2022-01-19 13:22:24,409 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2022-01-19 13:22:24,409 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1085 transitions, 7379 flow [2022-01-19 13:22:24,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:24,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:24,410 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:22:24,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 13:22:24,410 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:22:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1649567170, now seen corresponding path program 6 times [2022-01-19 13:22:24,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:24,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206241820] [2022-01-19 13:22:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:24,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:22:24,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:24,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206241820] [2022-01-19 13:22:24,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206241820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:24,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:24,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:22:24,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717954516] [2022-01-19 13:22:24,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:24,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:22:24,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:24,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:22:24,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:22:24,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 13:22:24,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 1085 transitions, 7379 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:24,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:24,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 13:22:24,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:39,420 INFO L129 PetriNetUnfolder]: 3851/43147 cut-off events. [2022-01-19 13:22:39,420 INFO L130 PetriNetUnfolder]: For 328119/358515 co-relation queries the response was YES. [2022-01-19 13:22:40,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88416 conditions, 43147 events. 3851/43147 cut-off events. For 328119/358515 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 630526 event pairs, 941 based on Foata normal form. 1160/41790 useless extension candidates. Maximal degree in co-relation 88315. Up to 2396 conditions per place. [2022-01-19 13:22:40,924 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 36 changer transitions 12/1119 dead transitions. [2022-01-19 13:22:40,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1119 transitions, 8002 flow [2022-01-19 13:22:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:22:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:22:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2022-01-19 13:22:40,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2022-01-19 13:22:40,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2022-01-19 13:22:40,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2022-01-19 13:22:40,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:40,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2022-01-19 13:22:40,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 799.75) internal successors, (3199), 4 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:40,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:40,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:40,930 INFO L186 Difference]: Start difference. First operand has 959 places, 1085 transitions, 7379 flow. Second operand 4 states and 3199 transitions. [2022-01-19 13:22:40,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1119 transitions, 8002 flow [2022-01-19 13:22:42,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 1119 transitions, 7933 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-01-19 13:22:42,412 INFO L242 Difference]: Finished difference. Result has 959 places, 1078 transitions, 7199 flow [2022-01-19 13:22:42,412 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7284, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7199, PETRI_PLACES=959, PETRI_TRANSITIONS=1078} [2022-01-19 13:22:42,413 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2022-01-19 13:22:42,413 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1078 transitions, 7199 flow [2022-01-19 13:22:42,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:42,413 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:42,414 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:22:42,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 13:22:42,414 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:22:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2120308048, now seen corresponding path program 1 times [2022-01-19 13:22:42,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319112144] [2022-01-19 13:22:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:42,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:22:42,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:42,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319112144] [2022-01-19 13:22:42,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319112144] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:42,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:42,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:22:42,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933306169] [2022-01-19 13:22:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:42,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:22:42,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:22:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:22:42,535 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:22:42,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 1078 transitions, 7199 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:22:42,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:42,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:22:42,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:23:09,329 INFO L129 PetriNetUnfolder]: 9968/76017 cut-off events. [2022-01-19 13:23:09,329 INFO L130 PetriNetUnfolder]: For 579542/639740 co-relation queries the response was YES. [2022-01-19 13:23:12,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172449 conditions, 76017 events. 9968/76017 cut-off events. For 579542/639740 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 1209904 event pairs, 1613 based on Foata normal form. 1647/74686 useless extension candidates. Maximal degree in co-relation 172349. Up to 6506 conditions per place. [2022-01-19 13:23:12,541 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 354 selfloop transitions, 108 changer transitions 74/1341 dead transitions. [2022-01-19 13:23:12,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 1341 transitions, 12182 flow [2022-01-19 13:23:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:23:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:23:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8482 transitions. [2022-01-19 13:23:12,545 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906099775664993 [2022-01-19 13:23:12,545 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8482 transitions. [2022-01-19 13:23:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8482 transitions. [2022-01-19 13:23:12,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:23:12,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8482 transitions. [2022-01-19 13:23:12,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 771.0909090909091) internal successors, (8482), 11 states have internal predecessors, (8482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:12,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:12,555 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:12,555 INFO L186 Difference]: Start difference. First operand has 959 places, 1078 transitions, 7199 flow. Second operand 11 states and 8482 transitions. [2022-01-19 13:23:12,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 1341 transitions, 12182 flow [2022-01-19 13:23:16,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 1341 transitions, 12111 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:23:16,893 INFO L242 Difference]: Finished difference. Result has 977 places, 1108 transitions, 8590 flow [2022-01-19 13:23:16,893 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7101, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=988, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8590, PETRI_PLACES=977, PETRI_TRANSITIONS=1108} [2022-01-19 13:23:16,894 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 221 predicate places. [2022-01-19 13:23:16,894 INFO L470 AbstractCegarLoop]: Abstraction has has 977 places, 1108 transitions, 8590 flow [2022-01-19 13:23:16,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:16,895 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:23:16,895 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:23:16,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 13:23:16,895 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:23:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:23:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -212299800, now seen corresponding path program 2 times [2022-01-19 13:23:16,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:23:16,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197601923] [2022-01-19 13:23:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:23:16,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:23:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:23:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:23:16,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:23:16,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197601923] [2022-01-19 13:23:16,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197601923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:23:16,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:23:16,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:23:16,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605262126] [2022-01-19 13:23:16,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:23:16,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:23:16,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:23:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:23:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:23:16,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:23:16,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 1108 transitions, 8590 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:16,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:23:16,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:23:16,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:23:49,783 INFO L129 PetriNetUnfolder]: 10420/84409 cut-off events. [2022-01-19 13:23:49,783 INFO L130 PetriNetUnfolder]: For 511901/566181 co-relation queries the response was YES. [2022-01-19 13:23:52,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185627 conditions, 84409 events. 10420/84409 cut-off events. For 511901/566181 co-relation queries the response was YES. Maximal size of possible extension queue 1457. Compared 1374969 event pairs, 3280 based on Foata normal form. 867/81455 useless extension candidates. Maximal degree in co-relation 185519. Up to 6015 conditions per place. [2022-01-19 13:23:52,988 INFO L132 encePairwiseOnDemand]: 833/851 looper letters, 325 selfloop transitions, 110 changer transitions 97/1337 dead transitions. [2022-01-19 13:23:52,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1337 transitions, 11729 flow [2022-01-19 13:23:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:23:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:23:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6950 transitions. [2022-01-19 13:23:52,991 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9074291682987335 [2022-01-19 13:23:52,991 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6950 transitions. [2022-01-19 13:23:52,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6950 transitions. [2022-01-19 13:23:52,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:23:52,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6950 transitions. [2022-01-19 13:23:52,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 772.2222222222222) internal successors, (6950), 9 states have internal predecessors, (6950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:52,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:52,999 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:52,999 INFO L186 Difference]: Start difference. First operand has 977 places, 1108 transitions, 8590 flow. Second operand 9 states and 6950 transitions. [2022-01-19 13:23:52,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1337 transitions, 11729 flow [2022-01-19 13:23:57,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 1337 transitions, 11589 flow, removed 59 selfloop flow, removed 1 redundant places. [2022-01-19 13:23:57,549 INFO L242 Difference]: Finished difference. Result has 988 places, 1120 transitions, 8736 flow [2022-01-19 13:23:57,550 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8736, PETRI_PLACES=988, PETRI_TRANSITIONS=1120} [2022-01-19 13:23:57,550 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 232 predicate places. [2022-01-19 13:23:57,550 INFO L470 AbstractCegarLoop]: Abstraction has has 988 places, 1120 transitions, 8736 flow [2022-01-19 13:23:57,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:57,551 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:23:57,551 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:23:57,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 13:23:57,551 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:23:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:23:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1953128738, now seen corresponding path program 3 times [2022-01-19 13:23:57,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:23:57,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573947725] [2022-01-19 13:23:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:23:57,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:23:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:23:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:23:57,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:23:57,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573947725] [2022-01-19 13:23:57,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573947725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:23:57,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:23:57,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:23:57,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316992210] [2022-01-19 13:23:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:23:57,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:23:57,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:23:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:23:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:23:57,678 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 13:23:57,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1120 transitions, 8736 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:23:57,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:23:57,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 13:23:57,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:24:25,629 INFO L129 PetriNetUnfolder]: 10107/77075 cut-off events. [2022-01-19 13:24:25,629 INFO L130 PetriNetUnfolder]: For 536213/590314 co-relation queries the response was YES. [2022-01-19 13:24:28,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177042 conditions, 77075 events. 10107/77075 cut-off events. For 536213/590314 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 1232092 event pairs, 4813 based on Foata normal form. 515/74119 useless extension candidates. Maximal degree in co-relation 176929. Up to 10257 conditions per place. [2022-01-19 13:24:29,127 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 343 selfloop transitions, 75 changer transitions 17/1240 dead transitions. [2022-01-19 13:24:29,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1240 transitions, 10594 flow [2022-01-19 13:24:29,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 13:24:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 13:24:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6165 transitions. [2022-01-19 13:24:29,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9055522914218567 [2022-01-19 13:24:29,130 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6165 transitions. [2022-01-19 13:24:29,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6165 transitions. [2022-01-19 13:24:29,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:24:29,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6165 transitions. [2022-01-19 13:24:29,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 770.625) internal successors, (6165), 8 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:24:29,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:24:29,138 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:24:29,138 INFO L186 Difference]: Start difference. First operand has 988 places, 1120 transitions, 8736 flow. Second operand 8 states and 6165 transitions. [2022-01-19 13:24:29,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1240 transitions, 10594 flow [2022-01-19 13:24:34,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1240 transitions, 10430 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-01-19 13:24:34,308 INFO L242 Difference]: Finished difference. Result has 998 places, 1136 transitions, 9134 flow [2022-01-19 13:24:34,309 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=8606, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9134, PETRI_PLACES=998, PETRI_TRANSITIONS=1136} [2022-01-19 13:24:34,309 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 242 predicate places. [2022-01-19 13:24:34,309 INFO L470 AbstractCegarLoop]: Abstraction has has 998 places, 1136 transitions, 9134 flow [2022-01-19 13:24:34,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:24:34,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:24:34,310 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:24:34,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 13:24:34,310 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:24:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:24:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1902964794, now seen corresponding path program 4 times [2022-01-19 13:24:34,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:24:34,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321422100] [2022-01-19 13:24:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:24:34,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:24:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:24:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 13:24:34,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:24:34,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321422100] [2022-01-19 13:24:34,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321422100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:24:34,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:24:34,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:24:34,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813192934] [2022-01-19 13:24:34,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:24:34,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:24:34,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:24:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:24:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:24:34,433 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 851 [2022-01-19 13:24:34,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1136 transitions, 9134 flow. Second operand has 6 states, 6 states have (on average 750.5) internal successors, (4503), 6 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:24:34,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:24:34,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 851 [2022-01-19 13:24:34,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-01-19 13:24:57,470 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 13:24:58,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-01-19 13:25:00,093 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 13:25:00,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 13:25:00,093 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-19 13:25:00,094 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 13:25:00,094 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 13:25:00,094 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 13:25:00,097 INFO L732 BasicCegarLoop]: Path program histogram: [9, 6, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:25:00,098 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 13:25:00,098 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 13:25:00,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 01:25:00 BasicIcfg [2022-01-19 13:25:00,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 13:25:00,100 INFO L158 Benchmark]: Toolchain (without parser) took 653681.82ms. Allocated memory was 377.5MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 323.4MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. [2022-01-19 13:25:00,101 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory was 340.8MB in the beginning and 340.7MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 13:25:00,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.27ms. Allocated memory was 377.5MB in the beginning and 484.4MB in the end (delta: 107.0MB). Free memory was 323.2MB in the beginning and 453.3MB in the end (delta: -130.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.0GB. [2022-01-19 13:25:00,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.03ms. Allocated memory is still 484.4MB. Free memory was 453.3MB in the beginning and 449.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 13:25:00,101 INFO L158 Benchmark]: Boogie Preprocessor took 48.49ms. Allocated memory is still 484.4MB. Free memory was 449.1MB in the beginning and 445.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 13:25:00,102 INFO L158 Benchmark]: RCFGBuilder took 838.89ms. Allocated memory is still 484.4MB. Free memory was 445.7MB in the beginning and 405.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2022-01-19 13:25:00,102 INFO L158 Benchmark]: TraceAbstraction took 652419.20ms. Allocated memory was 484.4MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 405.1MB in the beginning and 8.6GB in the end (delta: -8.2GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. [2022-01-19 13:25:00,103 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory was 340.8MB in the beginning and 340.7MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 299.27ms. Allocated memory was 377.5MB in the beginning and 484.4MB in the end (delta: 107.0MB). Free memory was 323.2MB in the beginning and 453.3MB in the end (delta: -130.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.03ms. Allocated memory is still 484.4MB. Free memory was 453.3MB in the beginning and 449.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.49ms. Allocated memory is still 484.4MB. Free memory was 449.1MB in the beginning and 445.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 838.89ms. Allocated memory is still 484.4MB. Free memory was 445.7MB in the beginning and 405.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 652419.20ms. Allocated memory was 484.4MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 405.1MB in the beginning and 8.6GB in the end (delta: -8.2GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1292 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 652.0s, OverallIterations: 43, TraceHistogramMax: 5, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 641.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3483 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3483 mSDsluCounter, 4996 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3616 mSDsCounter, 507 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6985 IncrementalHoareTripleChecker+Invalid, 7492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 507 mSolverCounterUnsat, 2279 mSDtfsCounter, 6985 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1884 SyntacticMatches, 1 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9134occurred in iteration=42, InterpolantAutomatonStates: 251, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 15991 NumberOfCodeBlocks, 15855 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 16526 ConstructedInterpolants, 0 QuantifiedInterpolants, 34570 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2190 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 49 InterpolantComputations, 41 PerfectInterpolantSequences, 6387/6495 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown