/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-Before.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 07:14:51,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 07:14:51,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 07:14:51,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 07:14:51,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 07:14:51,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 07:14:51,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 07:14:51,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 07:14:51,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 07:14:51,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 07:14:51,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 07:14:51,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 07:14:51,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 07:14:51,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 07:14:51,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 07:14:51,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 07:14:51,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 07:14:51,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 07:14:51,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 07:14:51,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 07:14:51,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 07:14:51,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 07:14:51,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 07:14:51,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 07:14:51,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 07:14:51,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 07:14:51,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 07:14:51,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 07:14:51,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 07:14:51,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 07:14:51,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 07:14:51,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 07:14:51,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 07:14:51,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 07:14:51,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 07:14:51,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 07:14:51,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 07:14:51,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 07:14:51,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 07:14:51,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 07:14:51,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 07:14:51,242 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-Before.epf [2022-01-19 07:14:51,254 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 07:14:51,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 07:14:51,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 07:14:51,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 07:14:51,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 07:14:51,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 07:14:51,255 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 07:14:51,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 07:14:51,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 07:14:51,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:14:51,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 07:14:51,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 07:14:51,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 07:14:51,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 07:14:51,258 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 07:14:51,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 07:14:51,258 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 07:14:51,258 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 07:14:51,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 07:14:51,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 07:14:51,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 07:14:51,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 07:14:51,415 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 07:14:51,416 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 07:14:51,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02196bf0d/d595bdb2a0e64541b5d5ab128e3a4f61/FLAG4516f0f2f [2022-01-19 07:14:51,801 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 07:14:51,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-01-19 07:14:51,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02196bf0d/d595bdb2a0e64541b5d5ab128e3a4f61/FLAG4516f0f2f [2022-01-19 07:14:52,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02196bf0d/d595bdb2a0e64541b5d5ab128e3a4f61 [2022-01-19 07:14:52,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 07:14:52,234 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 07:14:52,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 07:14:52,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 07:14:52,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 07:14:52,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef1249e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52, skipping insertion in model container [2022-01-19 07:14:52,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 07:14:52,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 07:14:52,446 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 07:14:52,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:14:52,471 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 07:14:52,529 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 07:14:52,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:14:52,545 INFO L208 MainTranslator]: Completed translation [2022-01-19 07:14:52,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52 WrapperNode [2022-01-19 07:14:52,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 07:14:52,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 07:14:52,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 07:14:52,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 07:14:52,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,599 INFO L137 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 646 [2022-01-19 07:14:52,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 07:14:52,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 07:14:52,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 07:14:52,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 07:14:52,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 07:14:52,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 07:14:52,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 07:14:52,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 07:14:52,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (1/1) ... [2022-01-19 07:14:52,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:14:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:14:52,675 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 07:14:52,681 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 07:14:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 07:14:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 07:14:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 07:14:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 07:14:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 07:14:52,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 07:14:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 07:14:52,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 07:14:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 07:14:52,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 07:14:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 07:14:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 07:14:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 07:14:52,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 07:14:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 07:14:52,702 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 07:14:52,800 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 07:14:52,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 07:14:53,422 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 07:14:53,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 07:14:53,431 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 07:14:53,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:14:53 BoogieIcfgContainer [2022-01-19 07:14:53,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 07:14:53,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 07:14:53,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 07:14:53,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 07:14:53,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 07:14:52" (1/3) ... [2022-01-19 07:14:53,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609628a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:14:53, skipping insertion in model container [2022-01-19 07:14:53,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:14:52" (2/3) ... [2022-01-19 07:14:53,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609628a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:14:53, skipping insertion in model container [2022-01-19 07:14:53,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:14:53" (3/3) ... [2022-01-19 07:14:53,438 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2022-01-19 07:14:53,442 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 07:14:53,442 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 07:14:53,442 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 07:14:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,501 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 07:14:53,502 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 07:14:53,502 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 07:14:53,503 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 07:14:53,503 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 07:14:53,503 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 07:14:53,503 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 07:14:53,503 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 07:14:53,503 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 07:14:53,503 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 07:14:53,504 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 07:14:53,504 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 07:14:53,504 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 07:14:53,504 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 07:14:53,504 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 07:14:53,504 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 07:14:53,505 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 07:14:53,505 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 07:14:53,505 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 07:14:53,505 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 07:14:53,506 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 07:14:53,506 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 07:14:53,506 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 07:14:53,506 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 07:14:53,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,510 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 07:14:53,510 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 07:14:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,511 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 07:14:53,511 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 07:14:53,511 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 07:14:53,512 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 07:14:53,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,513 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 07:14:53,513 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 07:14:53,513 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 07:14:53,513 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 07:14:53,513 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 07:14:53,513 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 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,514 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 07:14:53,515 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 07:14:53,515 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 07:14:53,515 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 07:14:53,516 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 07:14:53,517 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 07:14:53,521 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 07:14:53,521 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 07:14:53,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,521 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 07:14:53,521 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 07:14:53,521 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 07:14:53,521 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 07:14:53,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,523 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 07:14:53,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,523 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 07:14:53,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 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 07:14:53,524 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 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,525 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 07:14:53,525 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 07:14:53,525 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 07:14:53,525 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 07:14:53,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,526 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 07:14:53,526 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 07:14:53,526 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 07:14:53,527 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 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,541 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 07:14:53,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,542 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 07:14:53,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,542 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 07:14:53,542 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 07:14:53,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,543 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 07:14:53,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,543 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 07:14:53,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,543 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 07:14:53,543 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 07:14:53,544 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 07:14:53,544 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 07:14:53,544 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 07:14:53,544 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 07:14:53,544 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,544 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,544 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 07:14:53,544 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 07:14:53,544 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 07:14:53,544 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 07:14:53,544 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 07:14:53,544 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 07:14:53,545 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 07:14:53,545 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 07:14:53,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,545 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 07:14:53,545 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 07:14:53,545 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 07:14:53,545 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 07:14:53,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,547 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,549 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,551 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 07:14:53,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,556 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 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 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 07:14:53,563 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 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 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 07:14:53,564 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 07:14:53,564 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 07:14:53,564 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 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,564 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 07:14:53,565 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 07:14:53,565 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 07:14:53,565 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 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,587 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 07:14:53,587 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 07:14:53,587 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 07:14:53,587 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,588 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 07:14:53,589 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 07:14:53,589 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 07:14:53,589 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 07:14:53,589 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 07:14:53,589 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 07:14:53,589 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 07:14:53,589 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 07:14:53,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,592 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 07:14:53,593 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 07:14:53,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,593 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 07:14:53,593 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 07:14:53,593 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 07:14:53,593 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 07:14:53,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 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 07:14:53,594 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 07:14:53,594 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 07:14:53,594 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 07:14:53,594 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 07:14:53,594 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 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,597 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 07:14:53,597 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 07:14:53,597 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 07:14:53,597 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 07:14:53,598 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 07:14:53,598 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 07:14:53,598 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 07:14:53,598 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 07:14:53,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,598 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 07:14:53,598 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 07:14:53,598 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 07:14:53,598 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 07:14:53,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,599 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 07:14:53,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,599 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 07:14:53,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 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 07:14:53,600 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 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 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 07:14:53,601 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 07:14:53,601 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 07:14:53,601 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 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 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 07:14:53,602 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 07:14:53,602 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 07:14:53,602 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 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,605 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 07:14:53,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,605 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 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,606 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 07:14:53,606 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 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,606 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 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,606 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 07:14:53,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,607 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 07:14:53,607 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 07:14:53,607 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,608 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 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 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 07:14:53,609 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 07:14:53,609 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 07:14:53,609 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 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,609 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 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 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 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 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,613 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 07:14:53,613 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 07:14:53,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,615 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 07:14:53,615 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 07:14:53,615 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 07:14:53,615 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 07:14:53,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,615 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 07:14:53,615 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 07:14:53,615 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 07:14:53,615 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 07:14:53,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,627 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,627 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,627 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,627 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,627 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,628 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,628 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,628 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,628 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,629 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 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 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 07:14:53,632 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 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 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 07:14:53,632 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 07:14:53,632 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 07:14:53,632 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 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 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 07:14:53,633 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 07:14:53,633 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 07:14:53,633 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 07:14:53,633 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 07:14:53,633 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 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 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 07:14:53,634 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 07:14:53,634 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 07:14:53,634 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 07:14:53,634 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 07:14:53,634 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 07:14:53,634 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 07:14:53,634 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 07:14:53,634 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,634 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 07:14:53,635 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 07:14:53,635 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 07:14:53,635 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 07:14:53,635 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,635 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,635 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 07:14:53,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,636 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 07:14:53,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,636 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 07:14:53,636 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 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,637 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 07:14:53,637 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 07:14:53,637 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 07:14:53,637 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 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 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 07:14:53,638 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 07:14:53,638 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 07:14:53,638 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 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 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 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 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 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 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 07:14:53,641 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 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,641 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 07:14:53,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,642 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 07:14:53,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,642 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 07:14:53,642 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 07:14:53,642 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 07:14:53,642 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 07:14:53,642 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 07:14:53,642 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 07:14:53,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,642 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,643 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,643 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 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,644 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,645 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,645 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,646 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 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 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 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 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 07:14:53,648 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 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,648 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 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 07:14:53,649 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 07:14:53,649 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 07:14:53,649 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 07:14:53,649 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,649 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 07:14:53,649 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 07:14:53,649 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 07:14:53,649 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 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,650 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,651 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,652 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,653 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,654 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,655 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,656 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,657 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,658 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,659 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,660 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 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 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,664 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 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 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,665 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 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 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,668 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 07:14:53,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,669 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,670 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,671 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 07:14:53,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 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 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:14:53,678 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 07:14:53,716 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 07:14:53,721 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 07:14:53,721 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 07:14:53,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 770 places, 851 transitions, 1726 flow [2022-01-19 07:14:54,034 INFO L129 PetriNetUnfolder]: 91/848 cut-off events. [2022-01-19 07:14:54,035 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 07:14:54,056 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 07:14:54,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 770 places, 851 transitions, 1726 flow [2022-01-19 07:14:54,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 756 places, 837 transitions, 1692 flow [2022-01-19 07:14:54,223 INFO L129 PetriNetUnfolder]: 89/827 cut-off events. [2022-01-19 07:14:54,224 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 07:14:54,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:14:54,225 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 07:14:54,225 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 07:14:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:14:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1905717660, now seen corresponding path program 1 times [2022-01-19 07:14:54,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:14:54,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180278137] [2022-01-19 07:14:54,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:14:54,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:14:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:14:54,476 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 07:14:54,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:14:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180278137] [2022-01-19 07:14:54,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180278137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:14:54,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:14:54,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 07:14:54,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367459936] [2022-01-19 07:14:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:14:54,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 07:14:54,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:14:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 07:14:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 07:14:54,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 807 out of 851 [2022-01-19 07:14:54,519 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 07:14:54,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:14:54,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 807 of 851 [2022-01-19 07:14:54,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:14:54,769 INFO L129 PetriNetUnfolder]: 54/800 cut-off events. [2022-01-19 07:14:54,769 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-01-19 07:14:54,781 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 07:14:54,787 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 6 selfloop transitions, 0 changer transitions 7/800 dead transitions. [2022-01-19 07:14:54,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 800 transitions, 1630 flow [2022-01-19 07:14:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 07:14:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 07:14:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1657 transitions. [2022-01-19 07:14:54,803 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9735605170387779 [2022-01-19 07:14:54,803 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1657 transitions. [2022-01-19 07:14:54,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1657 transitions. [2022-01-19 07:14:54,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:14:54,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1657 transitions. [2022-01-19 07:14:54,814 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 07:14:54,823 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 07:14:54,824 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 07:14:54,825 INFO L186 Difference]: Start difference. First operand has 756 places, 837 transitions, 1692 flow. Second operand 2 states and 1657 transitions. [2022-01-19 07:14:54,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 800 transitions, 1630 flow [2022-01-19 07:14:54,833 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 07:14:54,845 INFO L242 Difference]: Finished difference. Result has 751 places, 793 transitions, 1592 flow [2022-01-19 07:14:54,848 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 07:14:54,851 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2022-01-19 07:14:54,852 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 793 transitions, 1592 flow [2022-01-19 07:14:54,852 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 07:14:54,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:14:54,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] [2022-01-19 07:14:54,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 07:14:54,853 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 07:14:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:14:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1986224669, now seen corresponding path program 1 times [2022-01-19 07:14:54,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:14:54,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574093571] [2022-01-19 07:14:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:14:54,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:14:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:14:55,030 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 07:14:55,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:14:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574093571] [2022-01-19 07:14:55,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574093571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:14:55,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:14:55,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:14:55,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164506230] [2022-01-19 07:14:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:14:55,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:14:55,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:14:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:14:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:14:55,034 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 07:14:55,037 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 07:14:55,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:14:55,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 07:14:55,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:14:55,910 INFO L129 PetriNetUnfolder]: 352/3450 cut-off events. [2022-01-19 07:14:55,910 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-01-19 07:14:55,955 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 07:14:55,972 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 33 selfloop transitions, 2 changer transitions 0/808 dead transitions. [2022-01-19 07:14:55,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 808 transitions, 1697 flow [2022-01-19 07:14:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:14:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:14:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 07:14:55,975 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 07:14:55,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 07:14:55,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 07:14:55,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:14:55,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 07:14:55,980 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 07:14:55,984 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 07:14:55,985 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 07:14:55,985 INFO L186 Difference]: Start difference. First operand has 751 places, 793 transitions, 1592 flow. Second operand 3 states and 2416 transitions. [2022-01-19 07:14:55,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 808 transitions, 1697 flow [2022-01-19 07:14:55,988 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 07:14:55,994 INFO L242 Difference]: Finished difference. Result has 748 places, 795 transitions, 1612 flow [2022-01-19 07:14:55,995 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 07:14:55,996 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -8 predicate places. [2022-01-19 07:14:55,996 INFO L470 AbstractCegarLoop]: Abstraction has has 748 places, 795 transitions, 1612 flow [2022-01-19 07:14:55,997 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 07:14:55,997 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:14:55,997 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 07:14:55,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 07:14:55,998 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 07:14:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:14:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1365782035, now seen corresponding path program 2 times [2022-01-19 07:14:55,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:14:55,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62829348] [2022-01-19 07:14:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:14:55,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:14:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:14:56,070 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 07:14:56,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:14:56,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62829348] [2022-01-19 07:14:56,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62829348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:14:56,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:14:56,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:14:56,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117685074] [2022-01-19 07:14:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:14:56,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:14:56,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:14:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:14:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:14:56,074 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 07:14:56,076 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 07:14:56,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:14:56,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 07:14:56,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:14:56,859 INFO L129 PetriNetUnfolder]: 378/3800 cut-off events. [2022-01-19 07:14:56,860 INFO L130 PetriNetUnfolder]: For 112/121 co-relation queries the response was YES. [2022-01-19 07:14:56,931 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 07:14:56,956 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 33 selfloop transitions, 4 changer transitions 0/810 dead transitions. [2022-01-19 07:14:56,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 810 transitions, 1725 flow [2022-01-19 07:14:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:14:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:14:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 07:14:56,960 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 07:14:56,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 07:14:56,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 07:14:56,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:14:56,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 07:14:56,965 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 07:14:56,969 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 07:14:56,970 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 07:14:56,970 INFO L186 Difference]: Start difference. First operand has 748 places, 795 transitions, 1612 flow. Second operand 3 states and 2416 transitions. [2022-01-19 07:14:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 810 transitions, 1725 flow [2022-01-19 07:14:56,975 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 07:14:56,982 INFO L242 Difference]: Finished difference. Result has 751 places, 797 transitions, 1642 flow [2022-01-19 07:14:56,983 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 07:14:56,984 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2022-01-19 07:14:56,984 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 797 transitions, 1642 flow [2022-01-19 07:14:56,985 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 07:14:56,985 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:14:56,985 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 07:14:56,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 07:14:56,985 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 07:14:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:14:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash 360113765, now seen corresponding path program 1 times [2022-01-19 07:14:56,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:14:56,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352089317] [2022-01-19 07:14:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:14:56,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:14:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:14:57,042 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 07:14:57,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:14:57,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352089317] [2022-01-19 07:14:57,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352089317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:14:57,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:14:57,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:14:57,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975587089] [2022-01-19 07:14:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:14:57,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:14:57,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:14:57,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:14:57,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:14:57,047 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 07:14:57,049 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 07:14:57,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:14:57,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 07:14:57,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:14:58,109 INFO L129 PetriNetUnfolder]: 789/6867 cut-off events. [2022-01-19 07:14:58,109 INFO L130 PetriNetUnfolder]: For 396/464 co-relation queries the response was YES. [2022-01-19 07:14:58,188 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 07:14:58,217 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 32 selfloop transitions, 5 changer transitions 0/812 dead transitions. [2022-01-19 07:14:58,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 812 transitions, 1757 flow [2022-01-19 07:14:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:14:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:14:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2022-01-19 07:14:58,221 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-01-19 07:14:58,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2022-01-19 07:14:58,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2022-01-19 07:14:58,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:14:58,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2022-01-19 07:14:58,225 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 07:14:58,229 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 07:14:58,230 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 07:14:58,230 INFO L186 Difference]: Start difference. First operand has 751 places, 797 transitions, 1642 flow. Second operand 3 states and 2415 transitions. [2022-01-19 07:14:58,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 812 transitions, 1757 flow [2022-01-19 07:14:58,235 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 07:14:58,242 INFO L242 Difference]: Finished difference. Result has 753 places, 800 transitions, 1675 flow [2022-01-19 07:14:58,243 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 07:14:58,244 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -3 predicate places. [2022-01-19 07:14:58,244 INFO L470 AbstractCegarLoop]: Abstraction has has 753 places, 800 transitions, 1675 flow [2022-01-19 07:14:58,245 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 07:14:58,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:14:58,245 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 07:14:58,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 07:14:58,245 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 07:14:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:14:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1778547265, now seen corresponding path program 2 times [2022-01-19 07:14:58,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:14:58,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251968654] [2022-01-19 07:14:58,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:14:58,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:14:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:14:58,287 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 07:14:58,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:14:58,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251968654] [2022-01-19 07:14:58,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251968654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:14:58,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:14:58,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:14:58,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691385909] [2022-01-19 07:14:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:14:58,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:14:58,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:14:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:14:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:14:58,291 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 07:14:58,293 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 07:14:58,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:14:58,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 07:14:58,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:14:59,298 INFO L129 PetriNetUnfolder]: 771/6975 cut-off events. [2022-01-19 07:14:59,299 INFO L130 PetriNetUnfolder]: For 566/636 co-relation queries the response was YES. [2022-01-19 07:14:59,378 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 07:14:59,412 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 37 selfloop transitions, 3 changer transitions 0/815 dead transitions. [2022-01-19 07:14:59,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 815 transitions, 1801 flow [2022-01-19 07:14:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:14:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:14:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2022-01-19 07:14:59,416 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-01-19 07:14:59,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2022-01-19 07:14:59,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2022-01-19 07:14:59,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:14:59,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2022-01-19 07:14:59,420 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 07:14:59,424 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 07:14:59,425 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 07:14:59,425 INFO L186 Difference]: Start difference. First operand has 753 places, 800 transitions, 1675 flow. Second operand 3 states and 2415 transitions. [2022-01-19 07:14:59,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 815 transitions, 1801 flow [2022-01-19 07:14:59,430 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 07:14:59,436 INFO L242 Difference]: Finished difference. Result has 755 places, 803 transitions, 1707 flow [2022-01-19 07:14:59,437 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 07:14:59,438 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -1 predicate places. [2022-01-19 07:14:59,438 INFO L470 AbstractCegarLoop]: Abstraction has has 755 places, 803 transitions, 1707 flow [2022-01-19 07:14:59,439 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 07:14:59,439 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:14:59,439 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 07:14:59,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 07:14:59,439 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 07:14:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:14:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1706386129, now seen corresponding path program 1 times [2022-01-19 07:14:59,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:14:59,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236129396] [2022-01-19 07:14:59,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:14:59,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:14:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:14:59,492 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 07:14:59,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:14:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236129396] [2022-01-19 07:14:59,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236129396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:14:59,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:14:59,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:14:59,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674107933] [2022-01-19 07:14:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:14:59,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:14:59,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:14:59,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:14:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:14:59,496 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 07:14:59,497 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 07:14:59,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:14:59,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 07:14:59,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:00,100 INFO L129 PetriNetUnfolder]: 296/3239 cut-off events. [2022-01-19 07:15:00,100 INFO L130 PetriNetUnfolder]: For 432/539 co-relation queries the response was YES. [2022-01-19 07:15:00,169 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 07:15:00,188 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 35 selfloop transitions, 4 changer transitions 0/818 dead transitions. [2022-01-19 07:15:00,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 818 transitions, 1828 flow [2022-01-19 07:15:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:15:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:15:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 07:15:00,192 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 07:15:00,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 07:15:00,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 07:15:00,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:00,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 07:15:00,196 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 07:15:00,198 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 07:15:00,199 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 07:15:00,199 INFO L186 Difference]: Start difference. First operand has 755 places, 803 transitions, 1707 flow. Second operand 3 states and 2416 transitions. [2022-01-19 07:15:00,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 818 transitions, 1828 flow [2022-01-19 07:15:00,203 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 07:15:00,209 INFO L242 Difference]: Finished difference. Result has 758 places, 805 transitions, 1738 flow [2022-01-19 07:15:00,210 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 07:15:00,211 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 2 predicate places. [2022-01-19 07:15:00,211 INFO L470 AbstractCegarLoop]: Abstraction has has 758 places, 805 transitions, 1738 flow [2022-01-19 07:15:00,211 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 07:15:00,212 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:00,212 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 07:15:00,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 07:15:00,212 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 07:15:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2139301649, now seen corresponding path program 2 times [2022-01-19 07:15:00,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:00,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597820935] [2022-01-19 07:15:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:00,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:00,249 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 07:15:00,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:00,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597820935] [2022-01-19 07:15:00,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597820935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:00,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:00,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:15:00,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515020510] [2022-01-19 07:15:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:00,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:15:00,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:15:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:15:00,255 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 07:15:00,256 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 07:15:00,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:00,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 07:15:00,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:00,859 INFO L129 PetriNetUnfolder]: 259/2956 cut-off events. [2022-01-19 07:15:00,860 INFO L130 PetriNetUnfolder]: For 637/733 co-relation queries the response was YES. [2022-01-19 07:15:00,919 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 07:15:00,936 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 35 selfloop transitions, 6 changer transitions 0/818 dead transitions. [2022-01-19 07:15:00,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 818 transitions, 1857 flow [2022-01-19 07:15:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:15:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:15:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 07:15:00,940 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 07:15:00,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 07:15:00,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 07:15:00,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:00,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 07:15:00,944 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 07:15:00,947 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 07:15:00,947 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 07:15:00,948 INFO L186 Difference]: Start difference. First operand has 758 places, 805 transitions, 1738 flow. Second operand 3 states and 2416 transitions. [2022-01-19 07:15:00,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 818 transitions, 1857 flow [2022-01-19 07:15:00,952 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 07:15:00,958 INFO L242 Difference]: Finished difference. Result has 761 places, 805 transitions, 1776 flow [2022-01-19 07:15:00,959 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 07:15:00,959 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 5 predicate places. [2022-01-19 07:15:00,959 INFO L470 AbstractCegarLoop]: Abstraction has has 761 places, 805 transitions, 1776 flow [2022-01-19 07:15:00,960 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 07:15:00,960 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:00,960 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 07:15:00,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 07:15:00,960 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 07:15:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:00,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1541370568, now seen corresponding path program 1 times [2022-01-19 07:15:00,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:00,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212599903] [2022-01-19 07:15:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:00,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:01,023 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 07:15:01,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:01,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212599903] [2022-01-19 07:15:01,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212599903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:01,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:01,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 07:15:01,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387609482] [2022-01-19 07:15:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:01,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 07:15:01,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 07:15:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 07:15:01,027 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 774 out of 851 [2022-01-19 07:15:01,029 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 07:15:01,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:01,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 774 of 851 [2022-01-19 07:15:01,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:01,312 INFO L129 PetriNetUnfolder]: 54/1036 cut-off events. [2022-01-19 07:15:01,312 INFO L130 PetriNetUnfolder]: For 141/179 co-relation queries the response was YES. [2022-01-19 07:15:01,331 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 07:15:01,336 INFO L132 encePairwiseOnDemand]: 836/851 looper letters, 39 selfloop transitions, 12 changer transitions 0/817 dead transitions. [2022-01-19 07:15:01,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 817 transitions, 1902 flow [2022-01-19 07:15:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:15:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:15:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3924 transitions. [2022-01-19 07:15:01,341 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9222091656874265 [2022-01-19 07:15:01,342 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3924 transitions. [2022-01-19 07:15:01,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3924 transitions. [2022-01-19 07:15:01,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:01,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3924 transitions. [2022-01-19 07:15:01,347 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 07:15:01,351 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 07:15:01,352 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 07:15:01,352 INFO L186 Difference]: Start difference. First operand has 761 places, 805 transitions, 1776 flow. Second operand 5 states and 3924 transitions. [2022-01-19 07:15:01,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 817 transitions, 1902 flow [2022-01-19 07:15:01,356 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 07:15:01,362 INFO L242 Difference]: Finished difference. Result has 764 places, 808 transitions, 1808 flow [2022-01-19 07:15:01,363 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 07:15:01,363 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 8 predicate places. [2022-01-19 07:15:01,364 INFO L470 AbstractCegarLoop]: Abstraction has has 764 places, 808 transitions, 1808 flow [2022-01-19 07:15:01,364 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 07:15:01,364 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:01,364 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 07:15:01,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 07:15:01,365 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 07:15:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash -502605305, now seen corresponding path program 1 times [2022-01-19 07:15:01,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437724203] [2022-01-19 07:15:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:01,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:01,429 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 07:15:01,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:01,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437724203] [2022-01-19 07:15:01,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437724203] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:15:01,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546327088] [2022-01-19 07:15:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:01,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:15:01,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:15:01,431 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 07:15:01,432 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 07:15:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:01,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 07:15:01,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:15:01,942 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 07:15:01,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:15:02,254 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 07:15:02,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546327088] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:15:02,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:15:02,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-01-19 07:15:02,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403955574] [2022-01-19 07:15:02,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:15:02,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 07:15:02,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 07:15:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-19 07:15:02,262 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2022-01-19 07:15:02,267 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 07:15:02,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:02,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2022-01-19 07:15:02,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:02,692 INFO L129 PetriNetUnfolder]: 54/1060 cut-off events. [2022-01-19 07:15:02,692 INFO L130 PetriNetUnfolder]: For 133/170 co-relation queries the response was YES. [2022-01-19 07:15:02,712 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 07:15:02,718 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 42 selfloop transitions, 33 changer transitions 0/838 dead transitions. [2022-01-19 07:15:02,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 838 transitions, 2024 flow [2022-01-19 07:15:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 07:15:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 07:15:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8562 transitions. [2022-01-19 07:15:02,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9146458711676103 [2022-01-19 07:15:02,730 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8562 transitions. [2022-01-19 07:15:02,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8562 transitions. [2022-01-19 07:15:02,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:02,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8562 transitions. [2022-01-19 07:15:02,744 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 07:15:02,755 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 07:15:02,757 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 07:15:02,757 INFO L186 Difference]: Start difference. First operand has 764 places, 808 transitions, 1808 flow. Second operand 11 states and 8562 transitions. [2022-01-19 07:15:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 838 transitions, 2024 flow [2022-01-19 07:15:02,761 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 07:15:02,768 INFO L242 Difference]: Finished difference. Result has 774 places, 826 transitions, 1957 flow [2022-01-19 07:15:02,769 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 07:15:02,770 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 18 predicate places. [2022-01-19 07:15:02,770 INFO L470 AbstractCegarLoop]: Abstraction has has 774 places, 826 transitions, 1957 flow [2022-01-19 07:15:02,772 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 07:15:02,772 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:02,772 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 07:15:02,792 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 07:15:02,985 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 07:15:02,985 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 07:15:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1742006581, now seen corresponding path program 2 times [2022-01-19 07:15:02,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:02,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176636548] [2022-01-19 07:15:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:02,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:03,112 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 07:15:03,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176636548] [2022-01-19 07:15:03,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176636548] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:15:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959110995] [2022-01-19 07:15:03,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 07:15:03,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:15:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:15:03,113 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 07:15:03,114 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 07:15:03,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 07:15:03,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:15:03,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 07:15:03,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:15:03,564 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 07:15:03,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 07:15:03,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959110995] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:03,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 07:15:03,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 07:15:03,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967952248] [2022-01-19 07:15:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:03,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 07:15:03,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 07:15:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 07:15:03,568 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2022-01-19 07:15:03,570 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 07:15:03,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:03,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2022-01-19 07:15:03,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:05,236 INFO L129 PetriNetUnfolder]: 1481/7153 cut-off events. [2022-01-19 07:15:05,236 INFO L130 PetriNetUnfolder]: For 3573/3940 co-relation queries the response was YES. [2022-01-19 07:15:05,326 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 07:15:05,477 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 111 selfloop transitions, 23 changer transitions 2/896 dead transitions. [2022-01-19 07:15:05,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 896 transitions, 2413 flow [2022-01-19 07:15:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:15:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:15:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5414 transitions. [2022-01-19 07:15:05,483 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088467349336915 [2022-01-19 07:15:05,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5414 transitions. [2022-01-19 07:15:05,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5414 transitions. [2022-01-19 07:15:05,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:05,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5414 transitions. [2022-01-19 07:15:05,491 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 07:15:05,498 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 07:15:05,499 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 07:15:05,499 INFO L186 Difference]: Start difference. First operand has 774 places, 826 transitions, 1957 flow. Second operand 7 states and 5414 transitions. [2022-01-19 07:15:05,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 896 transitions, 2413 flow [2022-01-19 07:15:05,506 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 07:15:05,513 INFO L242 Difference]: Finished difference. Result has 780 places, 838 transitions, 2035 flow [2022-01-19 07:15:05,514 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 07:15:05,515 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 24 predicate places. [2022-01-19 07:15:05,515 INFO L470 AbstractCegarLoop]: Abstraction has has 780 places, 838 transitions, 2035 flow [2022-01-19 07:15:05,516 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 07:15:05,516 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:05,516 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 07:15:05,533 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 07:15:05,731 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 07:15:05,731 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 07:15:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1654571657, now seen corresponding path program 3 times [2022-01-19 07:15:05,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:05,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381817817] [2022-01-19 07:15:05,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:05,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:05,826 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 07:15:05,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:05,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381817817] [2022-01-19 07:15:05,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381817817] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:15:05,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96609253] [2022-01-19 07:15:05,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 07:15:05,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:15:05,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:15:05,827 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 07:15:05,828 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 07:15:06,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-19 07:15:06,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:15:06,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 07:15:06,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:15:06,373 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 07:15:06,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 07:15:06,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96609253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:06,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 07:15:06,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 07:15:06,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622357138] [2022-01-19 07:15:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:06,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 07:15:06,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 07:15:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 07:15:06,377 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2022-01-19 07:15:06,379 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 07:15:06,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:06,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2022-01-19 07:15:06,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:08,272 INFO L129 PetriNetUnfolder]: 1489/7547 cut-off events. [2022-01-19 07:15:08,272 INFO L130 PetriNetUnfolder]: For 5189/5647 co-relation queries the response was YES. [2022-01-19 07:15:08,372 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 07:15:08,419 INFO L132 encePairwiseOnDemand]: 824/851 looper letters, 133 selfloop transitions, 43 changer transitions 1/937 dead transitions. [2022-01-19 07:15:08,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 937 transitions, 2763 flow [2022-01-19 07:15:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 07:15:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 07:15:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6949 transitions. [2022-01-19 07:15:08,427 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072986029507769 [2022-01-19 07:15:08,428 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6949 transitions. [2022-01-19 07:15:08,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6949 transitions. [2022-01-19 07:15:08,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:08,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6949 transitions. [2022-01-19 07:15:08,436 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 07:15:08,443 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 07:15:08,444 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 07:15:08,444 INFO L186 Difference]: Start difference. First operand has 780 places, 838 transitions, 2035 flow. Second operand 9 states and 6949 transitions. [2022-01-19 07:15:08,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 937 transitions, 2763 flow [2022-01-19 07:15:08,453 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 07:15:08,466 INFO L242 Difference]: Finished difference. Result has 792 places, 864 transitions, 2357 flow [2022-01-19 07:15:08,467 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 07:15:08,468 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 36 predicate places. [2022-01-19 07:15:08,468 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 864 transitions, 2357 flow [2022-01-19 07:15:08,469 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 07:15:08,469 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:08,469 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 07:15:08,489 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 07:15:08,676 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 07:15:08,676 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 07:15:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash -526497641, now seen corresponding path program 4 times [2022-01-19 07:15:08,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:08,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412621565] [2022-01-19 07:15:08,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:08,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:08,854 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 07:15:08,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412621565] [2022-01-19 07:15:08,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412621565] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:15:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453021418] [2022-01-19 07:15:08,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 07:15:08,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:15:08,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:15:08,856 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 07:15:08,857 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 07:15:09,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 07:15:09,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:15:09,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 07:15:09,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:15:09,428 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 07:15:09,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:15:09,879 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 07:15:09,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453021418] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:15:09,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:15:09,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-01-19 07:15:09,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156683254] [2022-01-19 07:15:09,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:15:09,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 07:15:09,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:09,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 07:15:09,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-01-19 07:15:09,892 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2022-01-19 07:15:09,901 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 07:15:09,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:09,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2022-01-19 07:15:09,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:10,676 INFO L129 PetriNetUnfolder]: 142/1959 cut-off events. [2022-01-19 07:15:10,676 INFO L130 PetriNetUnfolder]: For 1243/1393 co-relation queries the response was YES. [2022-01-19 07:15:10,703 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 07:15:10,713 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 54 selfloop transitions, 51 changer transitions 0/906 dead transitions. [2022-01-19 07:15:10,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 906 transitions, 2735 flow [2022-01-19 07:15:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 07:15:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 07:15:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 13218 transitions. [2022-01-19 07:15:10,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9136655837423101 [2022-01-19 07:15:10,731 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 13218 transitions. [2022-01-19 07:15:10,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 13218 transitions. [2022-01-19 07:15:10,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:10,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 13218 transitions. [2022-01-19 07:15:10,743 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 07:15:10,752 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 07:15:10,753 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 07:15:10,753 INFO L186 Difference]: Start difference. First operand has 792 places, 864 transitions, 2357 flow. Second operand 17 states and 13218 transitions. [2022-01-19 07:15:10,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 906 transitions, 2735 flow [2022-01-19 07:15:10,759 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 07:15:10,766 INFO L242 Difference]: Finished difference. Result has 811 places, 885 transitions, 2614 flow [2022-01-19 07:15:10,767 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 07:15:10,768 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 55 predicate places. [2022-01-19 07:15:10,768 INFO L470 AbstractCegarLoop]: Abstraction has has 811 places, 885 transitions, 2614 flow [2022-01-19 07:15:10,769 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 07:15:10,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:10,770 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 07:15:10,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 07:15:10,971 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 07:15:10,972 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 07:15:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 862760163, now seen corresponding path program 5 times [2022-01-19 07:15:10,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:10,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5599376] [2022-01-19 07:15:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:10,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:11,040 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 07:15:11,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:11,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5599376] [2022-01-19 07:15:11,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5599376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:11,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:11,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:15:11,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016611485] [2022-01-19 07:15:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:11,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:15:11,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:15:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:15:11,043 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 07:15:11,044 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 07:15:11,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:11,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 07:15:11,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:12,529 INFO L129 PetriNetUnfolder]: 584/6149 cut-off events. [2022-01-19 07:15:12,529 INFO L130 PetriNetUnfolder]: For 1859/2037 co-relation queries the response was YES. [2022-01-19 07:15:12,610 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 07:15:12,642 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 28 selfloop transitions, 4 changer transitions 0/894 dead transitions. [2022-01-19 07:15:12,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 894 transitions, 2700 flow [2022-01-19 07:15:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:15:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:15:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2403 transitions. [2022-01-19 07:15:12,645 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412455934195064 [2022-01-19 07:15:12,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2403 transitions. [2022-01-19 07:15:12,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2403 transitions. [2022-01-19 07:15:12,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:12,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2403 transitions. [2022-01-19 07:15:12,648 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 07:15:12,649 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 07:15:12,649 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 07:15:12,650 INFO L186 Difference]: Start difference. First operand has 811 places, 885 transitions, 2614 flow. Second operand 3 states and 2403 transitions. [2022-01-19 07:15:12,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 894 transitions, 2700 flow [2022-01-19 07:15:12,659 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 07:15:12,666 INFO L242 Difference]: Finished difference. Result has 806 places, 886 transitions, 2565 flow [2022-01-19 07:15:12,667 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 07:15:12,667 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 50 predicate places. [2022-01-19 07:15:12,668 INFO L470 AbstractCegarLoop]: Abstraction has has 806 places, 886 transitions, 2565 flow [2022-01-19 07:15:12,668 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 07:15:12,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:12,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] [2022-01-19 07:15:12,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 07:15:12,668 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 07:15:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1570533334, now seen corresponding path program 1 times [2022-01-19 07:15:12,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:12,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308026983] [2022-01-19 07:15:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:12,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:12,734 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 07:15:12,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308026983] [2022-01-19 07:15:12,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308026983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:12,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:12,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:15:12,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913428248] [2022-01-19 07:15:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:12,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:15:12,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:15:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:15:12,737 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 07:15:12,739 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 07:15:12,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:12,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 07:15:12,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:15,171 INFO L129 PetriNetUnfolder]: 629/8651 cut-off events. [2022-01-19 07:15:15,171 INFO L130 PetriNetUnfolder]: For 2559/2857 co-relation queries the response was YES. [2022-01-19 07:15:15,312 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 07:15:15,347 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 29 selfloop transitions, 4 changer transitions 0/896 dead transitions. [2022-01-19 07:15:15,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 896 transitions, 2656 flow [2022-01-19 07:15:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:15:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:15:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2404 transitions. [2022-01-19 07:15:15,352 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416372894633764 [2022-01-19 07:15:15,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2404 transitions. [2022-01-19 07:15:15,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2404 transitions. [2022-01-19 07:15:15,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:15,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2404 transitions. [2022-01-19 07:15:15,354 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 07:15:15,356 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 07:15:15,356 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 07:15:15,356 INFO L186 Difference]: Start difference. First operand has 806 places, 886 transitions, 2565 flow. Second operand 3 states and 2404 transitions. [2022-01-19 07:15:15,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 896 transitions, 2656 flow [2022-01-19 07:15:15,374 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 07:15:15,381 INFO L242 Difference]: Finished difference. Result has 808 places, 887 transitions, 2579 flow [2022-01-19 07:15:15,382 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 07:15:15,383 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 52 predicate places. [2022-01-19 07:15:15,383 INFO L470 AbstractCegarLoop]: Abstraction has has 808 places, 887 transitions, 2579 flow [2022-01-19 07:15:15,383 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 07:15:15,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:15,383 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 07:15:15,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 07:15:15,383 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 07:15:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1945096870, now seen corresponding path program 1 times [2022-01-19 07:15:15,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:15,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083029871] [2022-01-19 07:15:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:15,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:15,453 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 07:15:15,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:15,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083029871] [2022-01-19 07:15:15,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083029871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:15,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:15,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:15:15,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803297978] [2022-01-19 07:15:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:15,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:15:15,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:15:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:15:15,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 07:15:15,462 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 07:15:15,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:15,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 07:15:15,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:17,693 INFO L129 PetriNetUnfolder]: 1137/9273 cut-off events. [2022-01-19 07:15:17,693 INFO L130 PetriNetUnfolder]: For 2029/2488 co-relation queries the response was YES. [2022-01-19 07:15:17,790 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 07:15:17,823 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 27 selfloop transitions, 4 changer transitions 0/895 dead transitions. [2022-01-19 07:15:17,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 895 transitions, 2660 flow [2022-01-19 07:15:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:15:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:15:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2402 transitions. [2022-01-19 07:15:17,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9408538973756365 [2022-01-19 07:15:17,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2402 transitions. [2022-01-19 07:15:17,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2402 transitions. [2022-01-19 07:15:17,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:17,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2402 transitions. [2022-01-19 07:15:17,829 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 07:15:17,830 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 07:15:17,830 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 07:15:17,830 INFO L186 Difference]: Start difference. First operand has 808 places, 887 transitions, 2579 flow. Second operand 3 states and 2402 transitions. [2022-01-19 07:15:17,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 895 transitions, 2660 flow [2022-01-19 07:15:17,837 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 07:15:17,844 INFO L242 Difference]: Finished difference. Result has 810 places, 888 transitions, 2593 flow [2022-01-19 07:15:17,845 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 07:15:17,845 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 54 predicate places. [2022-01-19 07:15:17,846 INFO L470 AbstractCegarLoop]: Abstraction has has 810 places, 888 transitions, 2593 flow [2022-01-19 07:15:17,846 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 07:15:17,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:17,846 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 07:15:17,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 07:15:17,846 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 07:15:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1735256126, now seen corresponding path program 1 times [2022-01-19 07:15:17,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:17,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035800929] [2022-01-19 07:15:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:17,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:17,952 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 07:15:17,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:17,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035800929] [2022-01-19 07:15:17,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035800929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:17,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:17,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:15:17,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058011633] [2022-01-19 07:15:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:17,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:15:17,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:15:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:15:17,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:15:17,956 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 07:15:17,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:17,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:15:17,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:29,430 INFO L129 PetriNetUnfolder]: 8778/52330 cut-off events. [2022-01-19 07:15:29,431 INFO L130 PetriNetUnfolder]: For 37937/44699 co-relation queries the response was YES. [2022-01-19 07:15:30,382 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 07:15:30,640 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 214 selfloop transitions, 21 changer transitions 2/1034 dead transitions. [2022-01-19 07:15:30,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 1034 transitions, 3682 flow [2022-01-19 07:15:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:15:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:15:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5432 transitions. [2022-01-19 07:15:30,645 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9118683901292597 [2022-01-19 07:15:30,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5432 transitions. [2022-01-19 07:15:30,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5432 transitions. [2022-01-19 07:15:30,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:30,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5432 transitions. [2022-01-19 07:15:30,651 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 07:15:30,654 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 07:15:30,654 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 07:15:30,654 INFO L186 Difference]: Start difference. First operand has 810 places, 888 transitions, 2593 flow. Second operand 7 states and 5432 transitions. [2022-01-19 07:15:30,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 1034 transitions, 3682 flow [2022-01-19 07:15:30,923 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 07:15:30,931 INFO L242 Difference]: Finished difference. Result has 820 places, 910 transitions, 2877 flow [2022-01-19 07:15:30,931 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 07:15:30,932 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 64 predicate places. [2022-01-19 07:15:30,932 INFO L470 AbstractCegarLoop]: Abstraction has has 820 places, 910 transitions, 2877 flow [2022-01-19 07:15:30,932 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 07:15:30,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:30,933 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 07:15:30,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 07:15:30,933 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 07:15:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash -223892668, now seen corresponding path program 2 times [2022-01-19 07:15:30,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:30,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071084410] [2022-01-19 07:15:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:30,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:31,071 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 07:15:31,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:31,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071084410] [2022-01-19 07:15:31,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071084410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:31,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:31,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:15:31,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225285672] [2022-01-19 07:15:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:31,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:15:31,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:15:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:15:31,074 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:15:31,076 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 07:15:31,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:31,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:15:31,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:42,048 INFO L129 PetriNetUnfolder]: 8593/48956 cut-off events. [2022-01-19 07:15:42,048 INFO L130 PetriNetUnfolder]: For 51841/60724 co-relation queries the response was YES. [2022-01-19 07:15:43,017 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 07:15:43,393 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 184 selfloop transitions, 21 changer transitions 3/1005 dead transitions. [2022-01-19 07:15:43,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 1005 transitions, 3719 flow [2022-01-19 07:15:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:15:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:15:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5402 transitions. [2022-01-19 07:15:43,397 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906832298136646 [2022-01-19 07:15:43,397 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5402 transitions. [2022-01-19 07:15:43,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5402 transitions. [2022-01-19 07:15:43,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:43,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5402 transitions. [2022-01-19 07:15:43,403 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 07:15:43,406 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 07:15:43,406 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 07:15:43,406 INFO L186 Difference]: Start difference. First operand has 820 places, 910 transitions, 2877 flow. Second operand 7 states and 5402 transitions. [2022-01-19 07:15:43,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 1005 transitions, 3719 flow [2022-01-19 07:15:43,572 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 07:15:43,580 INFO L242 Difference]: Finished difference. Result has 828 places, 912 transitions, 2977 flow [2022-01-19 07:15:43,580 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 07:15:43,581 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 72 predicate places. [2022-01-19 07:15:43,581 INFO L470 AbstractCegarLoop]: Abstraction has has 828 places, 912 transitions, 2977 flow [2022-01-19 07:15:43,581 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 07:15:43,582 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:43,582 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 07:15:43,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 07:15:43,582 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 07:15:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -557134478, now seen corresponding path program 3 times [2022-01-19 07:15:43,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:43,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169118296] [2022-01-19 07:15:43,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:43,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:43,693 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 07:15:43,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169118296] [2022-01-19 07:15:43,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169118296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:43,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:43,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:15:43,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855651152] [2022-01-19 07:15:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:43,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:15:43,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:15:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:15:43,698 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:15:43,699 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 07:15:43,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:43,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:15:43,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:15:56,388 INFO L129 PetriNetUnfolder]: 9322/54905 cut-off events. [2022-01-19 07:15:56,388 INFO L130 PetriNetUnfolder]: For 66735/75920 co-relation queries the response was YES. [2022-01-19 07:15:57,571 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 07:15:57,794 INFO L132 encePairwiseOnDemand]: 835/851 looper letters, 199 selfloop transitions, 35 changer transitions 4/1035 dead transitions. [2022-01-19 07:15:57,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 1035 transitions, 3932 flow [2022-01-19 07:15:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 07:15:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 07:15:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4666 transitions. [2022-01-19 07:15:57,797 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9138268703486094 [2022-01-19 07:15:57,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4666 transitions. [2022-01-19 07:15:57,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4666 transitions. [2022-01-19 07:15:57,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:15:57,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4666 transitions. [2022-01-19 07:15:57,801 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 07:15:57,803 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 07:15:57,803 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 07:15:57,803 INFO L186 Difference]: Start difference. First operand has 828 places, 912 transitions, 2977 flow. Second operand 6 states and 4666 transitions. [2022-01-19 07:15:57,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 1035 transitions, 3932 flow [2022-01-19 07:15:57,979 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 07:15:57,987 INFO L242 Difference]: Finished difference. Result has 834 places, 935 transitions, 3267 flow [2022-01-19 07:15:57,988 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 07:15:57,989 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 78 predicate places. [2022-01-19 07:15:57,989 INFO L470 AbstractCegarLoop]: Abstraction has has 834 places, 935 transitions, 3267 flow [2022-01-19 07:15:57,989 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 07:15:57,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:15:57,989 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 07:15:57,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 07:15:57,990 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 07:15:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:15:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -779960328, now seen corresponding path program 4 times [2022-01-19 07:15:57,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:15:57,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139657551] [2022-01-19 07:15:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:15:57,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:15:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:15:58,074 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 07:15:58,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:15:58,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139657551] [2022-01-19 07:15:58,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139657551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:15:58,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:15:58,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:15:58,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112393046] [2022-01-19 07:15:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:15:58,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:15:58,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:15:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:15:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:15:58,078 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:15:58,079 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 07:15:58,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:15:58,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:15:58,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:16:12,823 INFO L129 PetriNetUnfolder]: 9788/63753 cut-off events. [2022-01-19 07:16:12,824 INFO L130 PetriNetUnfolder]: For 76890/83300 co-relation queries the response was YES. [2022-01-19 07:16:14,114 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 07:16:14,540 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 214 selfloop transitions, 24 changer transitions 13/1048 dead transitions. [2022-01-19 07:16:14,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 1048 transitions, 4153 flow [2022-01-19 07:16:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:16:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:16:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5413 transitions. [2022-01-19 07:16:14,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9086788652006044 [2022-01-19 07:16:14,543 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5413 transitions. [2022-01-19 07:16:14,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5413 transitions. [2022-01-19 07:16:14,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:16:14,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5413 transitions. [2022-01-19 07:16:14,546 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 07:16:14,549 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 07:16:14,550 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 07:16:14,550 INFO L186 Difference]: Start difference. First operand has 834 places, 935 transitions, 3267 flow. Second operand 7 states and 5413 transitions. [2022-01-19 07:16:14,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 1048 transitions, 4153 flow [2022-01-19 07:16:15,023 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 07:16:15,031 INFO L242 Difference]: Finished difference. Result has 842 places, 938 transitions, 3368 flow [2022-01-19 07:16:15,032 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 07:16:15,032 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 86 predicate places. [2022-01-19 07:16:15,033 INFO L470 AbstractCegarLoop]: Abstraction has has 842 places, 938 transitions, 3368 flow [2022-01-19 07:16:15,033 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 07:16:15,033 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:16:15,033 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 07:16:15,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 07:16:15,034 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 07:16:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:16:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 173589260, now seen corresponding path program 1 times [2022-01-19 07:16:15,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:16:15,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805915120] [2022-01-19 07:16:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:16:15,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:16:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:16:15,101 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 07:16:15,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:16:15,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805915120] [2022-01-19 07:16:15,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805915120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:16:15,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:16:15,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:16:15,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377249565] [2022-01-19 07:16:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:16:15,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:16:15,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:16:15,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:16:15,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:16:15,105 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 851 [2022-01-19 07:16:15,106 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 07:16:15,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:16:15,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 851 [2022-01-19 07:16:15,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:16:18,490 INFO L129 PetriNetUnfolder]: 839/11109 cut-off events. [2022-01-19 07:16:18,490 INFO L130 PetriNetUnfolder]: For 9757/12404 co-relation queries the response was YES. [2022-01-19 07:16:18,870 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 07:16:18,916 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 55 selfloop transitions, 3 changer transitions 4/952 dead transitions. [2022-01-19 07:16:18,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 952 transitions, 3529 flow [2022-01-19 07:16:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:16:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:16:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5369 transitions. [2022-01-19 07:16:18,919 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9012925969447708 [2022-01-19 07:16:18,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5369 transitions. [2022-01-19 07:16:18,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5369 transitions. [2022-01-19 07:16:18,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:16:18,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5369 transitions. [2022-01-19 07:16:18,923 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 07:16:18,926 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 07:16:18,926 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 07:16:18,926 INFO L186 Difference]: Start difference. First operand has 842 places, 938 transitions, 3368 flow. Second operand 7 states and 5369 transitions. [2022-01-19 07:16:18,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 952 transitions, 3529 flow [2022-01-19 07:16:18,952 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 07:16:18,959 INFO L242 Difference]: Finished difference. Result has 848 places, 940 transitions, 3370 flow [2022-01-19 07:16:18,960 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 07:16:18,960 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 92 predicate places. [2022-01-19 07:16:18,960 INFO L470 AbstractCegarLoop]: Abstraction has has 848 places, 940 transitions, 3370 flow [2022-01-19 07:16:18,961 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 07:16:18,961 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:16:18,961 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 07:16:18,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 07:16:18,961 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 07:16:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:16:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash -623110652, now seen corresponding path program 5 times [2022-01-19 07:16:18,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:16:18,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953348589] [2022-01-19 07:16:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:16:18,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:16:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:16:19,044 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 07:16:19,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:16:19,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953348589] [2022-01-19 07:16:19,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953348589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:16:19,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:16:19,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:16:19,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397635563] [2022-01-19 07:16:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:16:19,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:16:19,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:16:19,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:16:19,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:16:19,048 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:16:19,049 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 07:16:19,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:16:19,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:16:19,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:16:34,527 INFO L129 PetriNetUnfolder]: 9797/64246 cut-off events. [2022-01-19 07:16:34,527 INFO L130 PetriNetUnfolder]: For 83351/89923 co-relation queries the response was YES. [2022-01-19 07:16:36,038 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 07:16:36,299 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 215 selfloop transitions, 43 changer transitions 5/1062 dead transitions. [2022-01-19 07:16:36,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 1062 transitions, 4341 flow [2022-01-19 07:16:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:16:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:16:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5433 transitions. [2022-01-19 07:16:36,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9120362598623468 [2022-01-19 07:16:36,302 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5433 transitions. [2022-01-19 07:16:36,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5433 transitions. [2022-01-19 07:16:36,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:16:36,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5433 transitions. [2022-01-19 07:16:36,306 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 07:16:36,309 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 07:16:36,309 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 07:16:36,309 INFO L186 Difference]: Start difference. First operand has 848 places, 940 transitions, 3370 flow. Second operand 7 states and 5433 transitions. [2022-01-19 07:16:36,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 1062 transitions, 4341 flow [2022-01-19 07:16:36,934 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 07:16:36,942 INFO L242 Difference]: Finished difference. Result has 854 places, 943 transitions, 3526 flow [2022-01-19 07:16:36,943 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 07:16:36,943 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 98 predicate places. [2022-01-19 07:16:36,943 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 943 transitions, 3526 flow [2022-01-19 07:16:36,944 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 07:16:36,944 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:16:36,944 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 07:16:36,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 07:16:36,944 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 07:16:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:16:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1979499548, now seen corresponding path program 6 times [2022-01-19 07:16:36,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:16:36,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102134827] [2022-01-19 07:16:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:16:36,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:16:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:16:37,061 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 07:16:37,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:16:37,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102134827] [2022-01-19 07:16:37,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102134827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:16:37,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:16:37,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:16:37,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451229367] [2022-01-19 07:16:37,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:16:37,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:16:37,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:16:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:16:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:16:37,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:16:37,067 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 07:16:37,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:16:37,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:16:37,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:16:52,335 INFO L129 PetriNetUnfolder]: 9544/62437 cut-off events. [2022-01-19 07:16:52,336 INFO L130 PetriNetUnfolder]: For 106699/113969 co-relation queries the response was YES. [2022-01-19 07:16:54,088 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 07:16:54,351 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 193 selfloop transitions, 21 changer transitions 19/1032 dead transitions. [2022-01-19 07:16:54,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 1032 transitions, 4441 flow [2022-01-19 07:16:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:16:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:16:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5380 transitions. [2022-01-19 07:16:54,354 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9031391640087292 [2022-01-19 07:16:54,354 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5380 transitions. [2022-01-19 07:16:54,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5380 transitions. [2022-01-19 07:16:54,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:16:54,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5380 transitions. [2022-01-19 07:16:54,358 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 07:16:54,361 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 07:16:54,361 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 07:16:54,361 INFO L186 Difference]: Start difference. First operand has 854 places, 943 transitions, 3526 flow. Second operand 7 states and 5380 transitions. [2022-01-19 07:16:54,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 1032 transitions, 4441 flow [2022-01-19 07:16:54,938 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 07:16:54,946 INFO L242 Difference]: Finished difference. Result has 861 places, 954 transitions, 3675 flow [2022-01-19 07:16:54,946 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 07:16:54,947 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 105 predicate places. [2022-01-19 07:16:54,947 INFO L470 AbstractCegarLoop]: Abstraction has has 861 places, 954 transitions, 3675 flow [2022-01-19 07:16:54,947 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 07:16:54,947 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:16:54,948 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 07:16:54,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 07:16:54,948 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 07:16:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:16:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash -30601328, now seen corresponding path program 7 times [2022-01-19 07:16:54,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:16:54,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306355024] [2022-01-19 07:16:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:16:54,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:16:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:16:55,051 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 07:16:55,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:16:55,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306355024] [2022-01-19 07:16:55,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306355024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:16:55,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:16:55,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:16:55,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356207303] [2022-01-19 07:16:55,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:16:55,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:16:55,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:16:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:16:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:16:55,055 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:16:55,056 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 07:16:55,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:16:55,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:16:55,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:17:13,090 INFO L129 PetriNetUnfolder]: 11198/77159 cut-off events. [2022-01-19 07:17:13,091 INFO L130 PetriNetUnfolder]: For 116743/121649 co-relation queries the response was YES. [2022-01-19 07:17:14,858 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 07:17:15,152 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 206 selfloop transitions, 118 changer transitions 8/1131 dead transitions. [2022-01-19 07:17:15,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 1131 transitions, 5350 flow [2022-01-19 07:17:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 07:17:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 07:17:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6961 transitions. [2022-01-19 07:17:15,156 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088653871262566 [2022-01-19 07:17:15,156 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6961 transitions. [2022-01-19 07:17:15,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6961 transitions. [2022-01-19 07:17:15,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:17:15,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6961 transitions. [2022-01-19 07:17:15,161 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 07:17:15,164 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 07:17:15,164 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 07:17:15,164 INFO L186 Difference]: Start difference. First operand has 861 places, 954 transitions, 3675 flow. Second operand 9 states and 6961 transitions. [2022-01-19 07:17:15,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 1131 transitions, 5350 flow [2022-01-19 07:17:15,936 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 07:17:15,944 INFO L242 Difference]: Finished difference. Result has 875 places, 1019 transitions, 4668 flow [2022-01-19 07:17:15,944 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 07:17:15,945 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 119 predicate places. [2022-01-19 07:17:15,945 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 1019 transitions, 4668 flow [2022-01-19 07:17:15,945 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 07:17:15,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:17:15,946 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 07:17:15,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 07:17:15,946 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 07:17:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:17:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash 381741258, now seen corresponding path program 8 times [2022-01-19 07:17:15,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:17:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073474216] [2022-01-19 07:17:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:17:15,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:17:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:17:16,044 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 07:17:16,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:17:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073474216] [2022-01-19 07:17:16,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073474216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:17:16,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:17:16,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:17:16,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870890163] [2022-01-19 07:17:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:17:16,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:17:16,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:17:16,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:17:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:17:16,048 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:17:16,049 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 07:17:16,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:17:16,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:17:16,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:17:33,989 INFO L129 PetriNetUnfolder]: 10965/74335 cut-off events. [2022-01-19 07:17:33,989 INFO L130 PetriNetUnfolder]: For 147327/152218 co-relation queries the response was YES. [2022-01-19 07:17:35,879 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 07:17:36,376 INFO L132 encePairwiseOnDemand]: 813/851 looper letters, 173 selfloop transitions, 112 changer transitions 15/1099 dead transitions. [2022-01-19 07:17:36,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 1099 transitions, 5686 flow [2022-01-19 07:17:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:17:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:17:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6164 transitions. [2022-01-19 07:17:36,379 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2022-01-19 07:17:36,379 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6164 transitions. [2022-01-19 07:17:36,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6164 transitions. [2022-01-19 07:17:36,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:17:36,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6164 transitions. [2022-01-19 07:17:36,384 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 07:17:36,387 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 07:17:36,387 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 07:17:36,387 INFO L186 Difference]: Start difference. First operand has 875 places, 1019 transitions, 4668 flow. Second operand 8 states and 6164 transitions. [2022-01-19 07:17:36,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 1099 transitions, 5686 flow [2022-01-19 07:17:37,517 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 07:17:37,525 INFO L242 Difference]: Finished difference. Result has 883 places, 1019 transitions, 5032 flow [2022-01-19 07:17:37,526 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 07:17:37,527 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 127 predicate places. [2022-01-19 07:17:37,527 INFO L470 AbstractCegarLoop]: Abstraction has has 883 places, 1019 transitions, 5032 flow [2022-01-19 07:17:37,528 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 07:17:37,528 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:17:37,528 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 07:17:37,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 07:17:37,528 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 07:17:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:17:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1027995298, now seen corresponding path program 9 times [2022-01-19 07:17:37,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:17:37,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275965018] [2022-01-19 07:17:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:17:37,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:17:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:17:37,616 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 07:17:37,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:17:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275965018] [2022-01-19 07:17:37,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275965018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:17:37,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:17:37,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:17:37,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093646388] [2022-01-19 07:17:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:17:37,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:17:37,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:17:37,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:17:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:17:37,620 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:17:37,621 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 07:17:37,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:17:37,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:17:37,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:17:55,234 INFO L129 PetriNetUnfolder]: 10542/70042 cut-off events. [2022-01-19 07:17:55,234 INFO L130 PetriNetUnfolder]: For 180239/184855 co-relation queries the response was YES. [2022-01-19 07:17:57,223 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 07:17:57,517 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 210 selfloop transitions, 50 changer transitions 14/1073 dead transitions. [2022-01-19 07:17:57,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 1073 transitions, 5819 flow [2022-01-19 07:17:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 07:17:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 07:17:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4632 transitions. [2022-01-19 07:17:57,520 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9071680376028202 [2022-01-19 07:17:57,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4632 transitions. [2022-01-19 07:17:57,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4632 transitions. [2022-01-19 07:17:57,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:17:57,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4632 transitions. [2022-01-19 07:17:57,523 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 07:17:57,525 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 07:17:57,526 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 07:17:57,526 INFO L186 Difference]: Start difference. First operand has 883 places, 1019 transitions, 5032 flow. Second operand 6 states and 4632 transitions. [2022-01-19 07:17:57,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 1073 transitions, 5819 flow [2022-01-19 07:17:59,130 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 07:17:59,138 INFO L242 Difference]: Finished difference. Result has 886 places, 1018 transitions, 4977 flow [2022-01-19 07:17:59,138 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 07:17:59,139 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 130 predicate places. [2022-01-19 07:17:59,139 INFO L470 AbstractCegarLoop]: Abstraction has has 886 places, 1018 transitions, 4977 flow [2022-01-19 07:17:59,139 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 07:17:59,139 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:17:59,140 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 07:17:59,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 07:17:59,140 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 07:17:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:17:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1379995286, now seen corresponding path program 1 times [2022-01-19 07:17:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:17:59,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977662140] [2022-01-19 07:17:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:17:59,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:17:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:17:59,240 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 07:17:59,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:17:59,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977662140] [2022-01-19 07:17:59,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977662140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:17:59,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:17:59,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 07:17:59,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871257448] [2022-01-19 07:17:59,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:17:59,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:17:59,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:17:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:17:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 07:17:59,244 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 851 [2022-01-19 07:17:59,245 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 07:17:59,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:17:59,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 851 [2022-01-19 07:17:59,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:18:14,483 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 07:18:14,483 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2022-01-19 07:18:14,483 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 07:18:14,483 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 07:18:14,483 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 07:18:14,758 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 07:18:14,758 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-01-19 07:18:14,758 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 07:18:14,758 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 07:18:14,758 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 07:18:15,027 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 07:18:15,027 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-01-19 07:18:15,027 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 07:18:15,027 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 07:18:15,027 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 07:18:17,615 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 07:18:17,616 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-01-19 07:18:17,616 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 07:18:17,616 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 07:18:17,616 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 07:18:17,918 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 07:18:17,918 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2022-01-19 07:18:17,918 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 07:18:17,918 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 07:18:17,918 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 07:18:17,918 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 07:18:18,218 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 07:18:18,218 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-01-19 07:18:18,218 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 07:18:18,218 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 07:18:18,218 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 07:18:18,218 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 07:18:18,755 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 07:18:18,771 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-01-19 07:18:18,771 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 07:18:18,771 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 07:18:18,771 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 07:18:18,771 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 07:18:21,150 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 07:18:21,150 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-01-19 07:18:21,150 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 07:18:21,150 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 07:18:21,151 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 07:18:21,151 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 07:18:44,984 INFO L129 PetriNetUnfolder]: 35999/188452 cut-off events. [2022-01-19 07:18:44,984 INFO L130 PetriNetUnfolder]: For 140435/151291 co-relation queries the response was YES. [2022-01-19 07:18:49,752 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 07:18:50,304 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 129 selfloop transitions, 5 changer transitions 4/1085 dead transitions. [2022-01-19 07:18:50,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 1085 transitions, 5403 flow [2022-01-19 07:18:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:18:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:18:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6026 transitions. [2022-01-19 07:18:50,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851351351351351 [2022-01-19 07:18:50,308 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6026 transitions. [2022-01-19 07:18:50,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6026 transitions. [2022-01-19 07:18:50,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:18:50,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6026 transitions. [2022-01-19 07:18:50,312 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 07:18:50,314 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 07:18:50,315 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 07:18:50,315 INFO L186 Difference]: Start difference. First operand has 886 places, 1018 transitions, 4977 flow. Second operand 8 states and 6026 transitions. [2022-01-19 07:18:50,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 1085 transitions, 5403 flow [2022-01-19 07:18:51,951 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 07:18:51,959 INFO L242 Difference]: Finished difference. Result has 897 places, 1020 transitions, 4947 flow [2022-01-19 07:18:51,960 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 07:18:51,960 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 141 predicate places. [2022-01-19 07:18:51,960 INFO L470 AbstractCegarLoop]: Abstraction has has 897 places, 1020 transitions, 4947 flow [2022-01-19 07:18:51,961 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 07:18:51,961 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:18:51,961 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 07:18:51,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 07:18:51,961 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 07:18:51,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:18:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -674811482, now seen corresponding path program 1 times [2022-01-19 07:18:51,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:18:51,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719190667] [2022-01-19 07:18:51,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:18:51,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:18:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:18:52,106 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 07:18:52,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:18:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719190667] [2022-01-19 07:18:52,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719190667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:18:52,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:18:52,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 07:18:52,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872449685] [2022-01-19 07:18:52,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:18:52,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 07:18:52,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:18:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 07:18:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 07:18:52,110 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 851 [2022-01-19 07:18:52,112 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 07:18:52,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:18:52,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 851 [2022-01-19 07:18:52,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:19:07,810 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 07:19:07,811 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-01-19 07:19:07,811 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 07:19:07,811 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 07:19:07,811 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 07:19:10,668 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 07:19:10,668 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-01-19 07:19:10,668 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 07:19:10,668 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 07:19:10,668 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 07:19:11,538 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 07:19:11,538 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-01-19 07:19:11,538 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 07:19:11,538 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 07:19:11,538 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 07:19:11,538 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 07:19:14,538 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 07:19:14,538 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-01-19 07:19:14,538 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 07:19:14,538 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 07:19:14,538 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 07:19:14,538 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 07:19:44,277 INFO L129 PetriNetUnfolder]: 43180/195755 cut-off events. [2022-01-19 07:19:44,277 INFO L130 PetriNetUnfolder]: For 138591/158791 co-relation queries the response was YES. [2022-01-19 07:19:49,696 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 07:19:50,267 INFO L132 encePairwiseOnDemand]: 841/851 looper letters, 167 selfloop transitions, 7 changer transitions 9/1128 dead transitions. [2022-01-19 07:19:50,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 1128 transitions, 5566 flow [2022-01-19 07:19:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 07:19:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 07:19:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 7512 transitions. [2022-01-19 07:19:50,272 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827262044653349 [2022-01-19 07:19:50,272 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 7512 transitions. [2022-01-19 07:19:50,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 7512 transitions. [2022-01-19 07:19:50,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:19:50,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 7512 transitions. [2022-01-19 07:19:50,278 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 07:19:50,282 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 07:19:50,282 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 07:19:50,282 INFO L186 Difference]: Start difference. First operand has 897 places, 1020 transitions, 4947 flow. Second operand 10 states and 7512 transitions. [2022-01-19 07:19:50,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 1128 transitions, 5566 flow [2022-01-19 07:19:52,340 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 07:19:52,348 INFO L242 Difference]: Finished difference. Result has 907 places, 1024 transitions, 4983 flow [2022-01-19 07:19:52,348 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 07:19:52,349 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 151 predicate places. [2022-01-19 07:19:52,349 INFO L470 AbstractCegarLoop]: Abstraction has has 907 places, 1024 transitions, 4983 flow [2022-01-19 07:19:52,349 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 07:19:52,349 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:19:52,350 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 07:19:52,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 07:19:52,350 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 07:19:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:19:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2042486976, now seen corresponding path program 1 times [2022-01-19 07:19:52,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:19:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983883993] [2022-01-19 07:19:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:19:52,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:19:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:19:52,412 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 07:19:52,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:19:52,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983883993] [2022-01-19 07:19:52,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983883993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:19:52,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:19:52,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:19:52,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992639392] [2022-01-19 07:19:52,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:19:52,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:19:52,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:19:52,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:19:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:19:52,415 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:19:52,416 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 07:19:52,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:19:52,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:19:52,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:20:00,113 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 07:20:00,114 INFO L384 tUnfolder$Statistics]: this new event has 383 ancestors and is cut-off event [2022-01-19 07:20:00,114 INFO L387 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-01-19 07:20:00,114 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2022-01-19 07:20:00,114 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2022-01-19 07:20:02,750 INFO L129 PetriNetUnfolder]: 4018/39684 cut-off events. [2022-01-19 07:20:02,750 INFO L130 PetriNetUnfolder]: For 117653/124569 co-relation queries the response was YES. [2022-01-19 07:20:03,531 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 07:20:03,648 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 92 selfloop transitions, 27 changer transitions 34/1069 dead transitions. [2022-01-19 07:20:03,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 1069 transitions, 5623 flow [2022-01-19 07:20:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:20:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:20:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3990 transitions. [2022-01-19 07:20:03,651 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9377203290246768 [2022-01-19 07:20:03,651 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3990 transitions. [2022-01-19 07:20:03,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3990 transitions. [2022-01-19 07:20:03,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:20:03,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3990 transitions. [2022-01-19 07:20:03,653 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 07:20:03,655 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 07:20:03,655 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 07:20:03,655 INFO L186 Difference]: Start difference. First operand has 907 places, 1024 transitions, 4983 flow. Second operand 5 states and 3990 transitions. [2022-01-19 07:20:03,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 1069 transitions, 5623 flow [2022-01-19 07:20:04,495 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 07:20:04,503 INFO L242 Difference]: Finished difference. Result has 908 places, 1010 transitions, 4784 flow [2022-01-19 07:20:04,503 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 07:20:04,504 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 152 predicate places. [2022-01-19 07:20:04,504 INFO L470 AbstractCegarLoop]: Abstraction has has 908 places, 1010 transitions, 4784 flow [2022-01-19 07:20:04,504 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 07:20:04,504 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:20:04,504 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 07:20:04,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 07:20:04,505 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 07:20:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:20:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash 654373954, now seen corresponding path program 2 times [2022-01-19 07:20:04,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:20:04,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434741191] [2022-01-19 07:20:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:20:04,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:20:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:20:04,563 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 07:20:04,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:20:04,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434741191] [2022-01-19 07:20:04,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434741191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:20:04,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:20:04,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:20:04,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267767691] [2022-01-19 07:20:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:20:04,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:20:04,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:20:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:20:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:20:04,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:20:04,567 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 07:20:04,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:20:04,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:20:04,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:20:13,676 INFO L129 PetriNetUnfolder]: 3510/33096 cut-off events. [2022-01-19 07:20:13,677 INFO L130 PetriNetUnfolder]: For 146259/157774 co-relation queries the response was YES. [2022-01-19 07:20:14,418 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 07:20:14,529 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 118 selfloop transitions, 46 changer transitions 13/1093 dead transitions. [2022-01-19 07:20:14,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 1093 transitions, 6219 flow [2022-01-19 07:20:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:20:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:20:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2022-01-19 07:20:14,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2022-01-19 07:20:14,532 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2022-01-19 07:20:14,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2022-01-19 07:20:14,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:20:14,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2022-01-19 07:20:14,534 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 07:20:14,536 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 07:20:14,536 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 07:20:14,537 INFO L186 Difference]: Start difference. First operand has 908 places, 1010 transitions, 4784 flow. Second operand 5 states and 4006 transitions. [2022-01-19 07:20:14,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 1093 transitions, 6219 flow [2022-01-19 07:20:15,319 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 07:20:15,474 INFO L242 Difference]: Finished difference. Result has 909 places, 1034 transitions, 5380 flow [2022-01-19 07:20:15,474 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 07:20:15,475 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 153 predicate places. [2022-01-19 07:20:15,475 INFO L470 AbstractCegarLoop]: Abstraction has has 909 places, 1034 transitions, 5380 flow [2022-01-19 07:20:15,476 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 07:20:15,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:20:15,476 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 07:20:15,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 07:20:15,476 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 07:20:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:20:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash -203898288, now seen corresponding path program 3 times [2022-01-19 07:20:15,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:20:15,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760737941] [2022-01-19 07:20:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:20:15,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:20:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:20:15,536 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 07:20:15,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:20:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760737941] [2022-01-19 07:20:15,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760737941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:20:15,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:20:15,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:20:15,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176315199] [2022-01-19 07:20:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:20:15,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:20:15,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:20:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:20:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:20:15,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:20:15,540 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 07:20:15,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:20:15,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:20:15,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:20:26,878 INFO L129 PetriNetUnfolder]: 3917/40555 cut-off events. [2022-01-19 07:20:26,878 INFO L130 PetriNetUnfolder]: For 152315/167837 co-relation queries the response was YES. [2022-01-19 07:20:27,969 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 07:20:28,100 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 140 selfloop transitions, 49 changer transitions 24/1129 dead transitions. [2022-01-19 07:20:28,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 1129 transitions, 7081 flow [2022-01-19 07:20:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:20:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:20:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4010 transitions. [2022-01-19 07:20:28,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9424206815511164 [2022-01-19 07:20:28,103 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4010 transitions. [2022-01-19 07:20:28,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4010 transitions. [2022-01-19 07:20:28,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:20:28,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4010 transitions. [2022-01-19 07:20:28,106 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 07:20:28,107 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 07:20:28,108 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 07:20:28,108 INFO L186 Difference]: Start difference. First operand has 909 places, 1034 transitions, 5380 flow. Second operand 5 states and 4010 transitions. [2022-01-19 07:20:28,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 1129 transitions, 7081 flow [2022-01-19 07:20:28,973 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 07:20:28,982 INFO L242 Difference]: Finished difference. Result has 917 places, 1051 transitions, 5927 flow [2022-01-19 07:20:28,983 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 07:20:28,983 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 161 predicate places. [2022-01-19 07:20:28,983 INFO L470 AbstractCegarLoop]: Abstraction has has 917 places, 1051 transitions, 5927 flow [2022-01-19 07:20:28,984 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 07:20:28,984 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:20:28,984 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 07:20:28,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 07:20:28,984 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 07:20:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:20:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 582216258, now seen corresponding path program 4 times [2022-01-19 07:20:28,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:20:28,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485121746] [2022-01-19 07:20:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:20:28,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:20:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:20:29,043 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 07:20:29,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:20:29,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485121746] [2022-01-19 07:20:29,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485121746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:20:29,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:20:29,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:20:29,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414387279] [2022-01-19 07:20:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:20:29,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:20:29,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:20:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:20:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:20:29,046 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:20:29,047 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 07:20:29,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:20:29,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:20:29,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:20:40,360 INFO L129 PetriNetUnfolder]: 3729/38781 cut-off events. [2022-01-19 07:20:40,360 INFO L130 PetriNetUnfolder]: For 164374/182131 co-relation queries the response was YES. [2022-01-19 07:20:41,107 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 07:20:41,227 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 126 selfloop transitions, 40 changer transitions 2/1084 dead transitions. [2022-01-19 07:20:41,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 1084 transitions, 6434 flow [2022-01-19 07:20:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 07:20:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 07:20:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3200 transitions. [2022-01-19 07:20:41,229 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9400705052878966 [2022-01-19 07:20:41,229 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3200 transitions. [2022-01-19 07:20:41,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3200 transitions. [2022-01-19 07:20:41,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:20:41,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3200 transitions. [2022-01-19 07:20:41,231 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 07:20:41,233 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 07:20:41,233 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 07:20:41,233 INFO L186 Difference]: Start difference. First operand has 917 places, 1051 transitions, 5927 flow. Second operand 4 states and 3200 transitions. [2022-01-19 07:20:41,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 1084 transitions, 6434 flow [2022-01-19 07:20:42,021 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 07:20:42,030 INFO L242 Difference]: Finished difference. Result has 921 places, 1052 transitions, 6041 flow [2022-01-19 07:20:42,031 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 07:20:42,031 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 165 predicate places. [2022-01-19 07:20:42,031 INFO L470 AbstractCegarLoop]: Abstraction has has 921 places, 1052 transitions, 6041 flow [2022-01-19 07:20:42,032 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 07:20:42,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:20:42,032 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 07:20:42,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 07:20:42,032 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 07:20:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:20:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash 499597566, now seen corresponding path program 1 times [2022-01-19 07:20:42,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:20:42,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312341958] [2022-01-19 07:20:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:20:42,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:20:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:20:42,105 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 07:20:42,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:20:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312341958] [2022-01-19 07:20:42,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312341958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:20:42,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:20:42,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:20:42,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046818130] [2022-01-19 07:20:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:20:42,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:20:42,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:20:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:20:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:20:42,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:20:42,109 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 07:20:42,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:20:42,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:20:42,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:20:52,992 INFO L129 PetriNetUnfolder]: 3902/39029 cut-off events. [2022-01-19 07:20:52,993 INFO L130 PetriNetUnfolder]: For 176578/191838 co-relation queries the response was YES. [2022-01-19 07:20:53,954 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 07:20:54,082 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 143 selfloop transitions, 30 changer transitions 20/1109 dead transitions. [2022-01-19 07:20:54,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 1109 transitions, 7261 flow [2022-01-19 07:20:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 07:20:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 07:20:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3201 transitions. [2022-01-19 07:20:54,084 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9403642773207991 [2022-01-19 07:20:54,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3201 transitions. [2022-01-19 07:20:54,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3201 transitions. [2022-01-19 07:20:54,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:20:54,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3201 transitions. [2022-01-19 07:20:54,087 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 07:20:54,088 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 07:20:54,088 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 07:20:54,088 INFO L186 Difference]: Start difference. First operand has 921 places, 1052 transitions, 6041 flow. Second operand 4 states and 3201 transitions. [2022-01-19 07:20:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 1109 transitions, 7261 flow [2022-01-19 07:20:54,916 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 07:20:54,925 INFO L242 Difference]: Finished difference. Result has 927 places, 1055 transitions, 6225 flow [2022-01-19 07:20:54,926 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 07:20:54,926 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 171 predicate places. [2022-01-19 07:20:54,926 INFO L470 AbstractCegarLoop]: Abstraction has has 927 places, 1055 transitions, 6225 flow [2022-01-19 07:20:54,927 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 07:20:54,927 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:20:54,927 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 07:20:54,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 07:20:54,927 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 07:20:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:20:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash -712975400, now seen corresponding path program 2 times [2022-01-19 07:20:54,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:20:54,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825497423] [2022-01-19 07:20:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:20:54,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:20:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:20:54,989 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 07:20:54,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:20:54,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825497423] [2022-01-19 07:20:54,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825497423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:20:54,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:20:54,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:20:54,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319619231] [2022-01-19 07:20:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:20:54,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:20:54,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:20:54,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:20:54,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:20:54,992 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:20:54,993 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 07:20:54,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:20:54,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:20:54,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:21:07,987 INFO L129 PetriNetUnfolder]: 4182/46385 cut-off events. [2022-01-19 07:21:07,988 INFO L130 PetriNetUnfolder]: For 218429/235687 co-relation queries the response was YES. [2022-01-19 07:21:09,165 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 07:21:09,303 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 129 selfloop transitions, 40 changer transitions 11/1096 dead transitions. [2022-01-19 07:21:09,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 1096 transitions, 6818 flow [2022-01-19 07:21:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:21:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:21:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3991 transitions. [2022-01-19 07:21:09,306 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379553466509988 [2022-01-19 07:21:09,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3991 transitions. [2022-01-19 07:21:09,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3991 transitions. [2022-01-19 07:21:09,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:21:09,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3991 transitions. [2022-01-19 07:21:09,308 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 07:21:09,310 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 07:21:09,310 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 07:21:09,310 INFO L186 Difference]: Start difference. First operand has 927 places, 1055 transitions, 6225 flow. Second operand 5 states and 3991 transitions. [2022-01-19 07:21:09,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 1096 transitions, 6818 flow [2022-01-19 07:21:10,314 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 07:21:10,323 INFO L242 Difference]: Finished difference. Result has 934 places, 1057 transitions, 6376 flow [2022-01-19 07:21:10,323 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 07:21:10,324 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 178 predicate places. [2022-01-19 07:21:10,324 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 1057 transitions, 6376 flow [2022-01-19 07:21:10,324 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 07:21:10,324 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:21:10,324 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 07:21:10,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 07:21:10,324 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 07:21:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:21:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash 862920256, now seen corresponding path program 3 times [2022-01-19 07:21:10,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:21:10,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795493644] [2022-01-19 07:21:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:21:10,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:21:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:21:10,396 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 07:21:10,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:21:10,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795493644] [2022-01-19 07:21:10,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795493644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:21:10,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:21:10,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:21:10,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456618357] [2022-01-19 07:21:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:21:10,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:21:10,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:21:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:21:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:21:10,399 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:21:10,400 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 07:21:10,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:21:10,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:21:10,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:21:22,710 INFO L129 PetriNetUnfolder]: 3761/42128 cut-off events. [2022-01-19 07:21:22,710 INFO L130 PetriNetUnfolder]: For 248281/268563 co-relation queries the response was YES. [2022-01-19 07:21:23,927 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 07:21:24,059 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 115 selfloop transitions, 49 changer transitions 13/1093 dead transitions. [2022-01-19 07:21:24,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 1093 transitions, 6915 flow [2022-01-19 07:21:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:21:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:21:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2022-01-19 07:21:24,061 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2022-01-19 07:21:24,061 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2022-01-19 07:21:24,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2022-01-19 07:21:24,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:21:24,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2022-01-19 07:21:24,064 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 07:21:24,066 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 07:21:24,066 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 07:21:24,066 INFO L186 Difference]: Start difference. First operand has 934 places, 1057 transitions, 6376 flow. Second operand 5 states and 3989 transitions. [2022-01-19 07:21:24,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 1093 transitions, 6915 flow [2022-01-19 07:21:25,256 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 07:21:25,265 INFO L242 Difference]: Finished difference. Result has 939 places, 1057 transitions, 6437 flow [2022-01-19 07:21:25,265 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 07:21:25,266 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 183 predicate places. [2022-01-19 07:21:25,266 INFO L470 AbstractCegarLoop]: Abstraction has has 939 places, 1057 transitions, 6437 flow [2022-01-19 07:21:25,267 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 07:21:25,267 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:21:25,267 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 07:21:25,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 07:21:25,267 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 07:21:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:21:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1232968302, now seen corresponding path program 4 times [2022-01-19 07:21:25,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:21:25,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468896304] [2022-01-19 07:21:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:21:25,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:21:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:21:25,335 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 07:21:25,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:21:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468896304] [2022-01-19 07:21:25,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468896304] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:21:25,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:21:25,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:21:25,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738446672] [2022-01-19 07:21:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:21:25,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:21:25,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:21:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:21:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:21:25,338 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:21:25,339 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 07:21:25,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:21:25,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:21:25,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:21:36,814 INFO L129 PetriNetUnfolder]: 3519/37563 cut-off events. [2022-01-19 07:21:36,815 INFO L130 PetriNetUnfolder]: For 274958/302299 co-relation queries the response was YES. [2022-01-19 07:21:37,972 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 07:21:38,102 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 164 selfloop transitions, 48 changer transitions 15/1143 dead transitions. [2022-01-19 07:21:38,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 1143 transitions, 7983 flow [2022-01-19 07:21:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:21:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:21:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4002 transitions. [2022-01-19 07:21:38,105 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2022-01-19 07:21:38,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4002 transitions. [2022-01-19 07:21:38,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4002 transitions. [2022-01-19 07:21:38,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:21:38,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4002 transitions. [2022-01-19 07:21:38,108 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 07:21:38,109 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 07:21:38,110 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 07:21:38,110 INFO L186 Difference]: Start difference. First operand has 939 places, 1057 transitions, 6437 flow. Second operand 5 states and 4002 transitions. [2022-01-19 07:21:38,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 1143 transitions, 7983 flow [2022-01-19 07:21:39,322 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 07:21:39,332 INFO L242 Difference]: Finished difference. Result has 944 places, 1076 transitions, 6963 flow [2022-01-19 07:21:39,332 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 07:21:39,333 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 188 predicate places. [2022-01-19 07:21:39,333 INFO L470 AbstractCegarLoop]: Abstraction has has 944 places, 1076 transitions, 6963 flow [2022-01-19 07:21:39,333 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 07:21:39,333 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:21:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:39,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 07:21:39,333 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 07:21:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:21:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 13610576, now seen corresponding path program 5 times [2022-01-19 07:21:39,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:21:39,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350148371] [2022-01-19 07:21:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:21:39,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:21:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:21:39,407 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 07:21:39,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:21:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350148371] [2022-01-19 07:21:39,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350148371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:21:39,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:21:39,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:21:39,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124858808] [2022-01-19 07:21:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:21:39,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:21:39,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:21:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:21:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:21:39,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:21:39,412 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 07:21:39,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:21:39,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:21:39,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:21:51,676 INFO L129 PetriNetUnfolder]: 3835/42373 cut-off events. [2022-01-19 07:21:51,676 INFO L130 PetriNetUnfolder]: For 285346/313489 co-relation queries the response was YES. [2022-01-19 07:21:52,967 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 07:21:53,097 INFO L132 encePairwiseOnDemand]: 839/851 looper letters, 165 selfloop transitions, 57 changer transitions 9/1147 dead transitions. [2022-01-19 07:21:53,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1147 transitions, 8095 flow [2022-01-19 07:21:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:21:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:21:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2022-01-19 07:21:53,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2022-01-19 07:21:53,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2022-01-19 07:21:53,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2022-01-19 07:21:53,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:21:53,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2022-01-19 07:21:53,102 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 07:21:53,104 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 07:21:53,104 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 07:21:53,104 INFO L186 Difference]: Start difference. First operand has 944 places, 1076 transitions, 6963 flow. Second operand 5 states and 4006 transitions. [2022-01-19 07:21:53,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1147 transitions, 8095 flow [2022-01-19 07:21:54,235 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 07:21:54,244 INFO L242 Difference]: Finished difference. Result has 952 places, 1088 transitions, 7398 flow [2022-01-19 07:21:54,244 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 07:21:54,245 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 196 predicate places. [2022-01-19 07:21:54,245 INFO L470 AbstractCegarLoop]: Abstraction has has 952 places, 1088 transitions, 7398 flow [2022-01-19 07:21:54,245 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 07:21:54,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:21:54,245 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 07:21:54,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 07:21:54,246 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 07:21:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:21:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash 993155130, now seen corresponding path program 6 times [2022-01-19 07:21:54,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:21:54,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484907409] [2022-01-19 07:21:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:21:54,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:21:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:21:54,299 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 07:21:54,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:21:54,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484907409] [2022-01-19 07:21:54,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484907409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:21:54,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:21:54,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:21:54,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839566471] [2022-01-19 07:21:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:21:54,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:21:54,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:21:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:21:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:21:54,302 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:21:54,303 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 07:21:54,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:21:54,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:21:54,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:22:07,191 INFO L129 PetriNetUnfolder]: 3828/41448 cut-off events. [2022-01-19 07:22:07,191 INFO L130 PetriNetUnfolder]: For 319949/350046 co-relation queries the response was YES. [2022-01-19 07:22:08,375 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 07:22:08,509 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 46 changer transitions 6/1123 dead transitions. [2022-01-19 07:22:08,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 1123 transitions, 8034 flow [2022-01-19 07:22:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 07:22:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 07:22:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2022-01-19 07:22:08,511 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2022-01-19 07:22:08,511 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2022-01-19 07:22:08,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2022-01-19 07:22:08,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:22:08,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2022-01-19 07:22:08,514 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 07:22:08,515 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 07:22:08,515 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 07:22:08,515 INFO L186 Difference]: Start difference. First operand has 952 places, 1088 transitions, 7398 flow. Second operand 4 states and 3199 transitions. [2022-01-19 07:22:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 1123 transitions, 8034 flow [2022-01-19 07:22:09,592 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 07:22:09,600 INFO L242 Difference]: Finished difference. Result has 954 places, 1087 transitions, 7422 flow [2022-01-19 07:22:09,601 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 07:22:09,601 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 198 predicate places. [2022-01-19 07:22:09,601 INFO L470 AbstractCegarLoop]: Abstraction has has 954 places, 1087 transitions, 7422 flow [2022-01-19 07:22:09,602 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 07:22:09,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:22:09,602 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 07:22:09,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 07:22:09,602 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 07:22:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:22:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1985037212, now seen corresponding path program 5 times [2022-01-19 07:22:09,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:22:09,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508268980] [2022-01-19 07:22:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:22:09,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:22:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:22:09,672 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 07:22:09,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:22:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508268980] [2022-01-19 07:22:09,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508268980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:22:09,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:22:09,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:22:09,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714353411] [2022-01-19 07:22:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:22:09,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:22:09,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:22:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:22:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:22:09,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:22:09,678 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 07:22:09,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:22:09,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:22:09,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:22:24,165 INFO L129 PetriNetUnfolder]: 4217/47713 cut-off events. [2022-01-19 07:22:24,165 INFO L130 PetriNetUnfolder]: For 323729/350891 co-relation queries the response was YES. [2022-01-19 07:22:25,576 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 07:22:25,724 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 165 selfloop transitions, 27 changer transitions 17/1125 dead transitions. [2022-01-19 07:22:25,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 1125 transitions, 8035 flow [2022-01-19 07:22:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 07:22:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 07:22:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2022-01-19 07:22:25,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2022-01-19 07:22:25,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2022-01-19 07:22:25,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2022-01-19 07:22:25,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:22:25,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2022-01-19 07:22:25,729 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 07:22:25,731 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 07:22:25,731 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 07:22:25,731 INFO L186 Difference]: Start difference. First operand has 954 places, 1087 transitions, 7422 flow. Second operand 5 states and 3989 transitions. [2022-01-19 07:22:25,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 1125 transitions, 8035 flow [2022-01-19 07:22:27,119 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 07:22:27,129 INFO L242 Difference]: Finished difference. Result has 959 places, 1085 transitions, 7379 flow [2022-01-19 07:22:27,130 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 07:22:27,130 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2022-01-19 07:22:27,130 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1085 transitions, 7379 flow [2022-01-19 07:22:27,130 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 07:22:27,130 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:22:27,131 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 07:22:27,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 07:22:27,131 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 07:22:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:22:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1649567170, now seen corresponding path program 6 times [2022-01-19 07:22:27,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:22:27,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847597813] [2022-01-19 07:22:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:22:27,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:22:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:22:27,187 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 07:22:27,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:22:27,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847597813] [2022-01-19 07:22:27,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847597813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:22:27,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:22:27,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 07:22:27,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704316228] [2022-01-19 07:22:27,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:22:27,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 07:22:27,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:22:27,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 07:22:27,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 07:22:27,190 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 07:22:27,191 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 07:22:27,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:22:27,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 07:22:27,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:22:40,790 INFO L129 PetriNetUnfolder]: 3851/43147 cut-off events. [2022-01-19 07:22:40,791 INFO L130 PetriNetUnfolder]: For 328119/358515 co-relation queries the response was YES. [2022-01-19 07:22:42,125 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 07:22:42,262 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 36 changer transitions 12/1119 dead transitions. [2022-01-19 07:22:42,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1119 transitions, 8002 flow [2022-01-19 07:22:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 07:22:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 07:22:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2022-01-19 07:22:42,264 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2022-01-19 07:22:42,264 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2022-01-19 07:22:42,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2022-01-19 07:22:42,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:22:42,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2022-01-19 07:22:42,266 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 07:22:42,268 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 07:22:42,268 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 07:22:42,268 INFO L186 Difference]: Start difference. First operand has 959 places, 1085 transitions, 7379 flow. Second operand 4 states and 3199 transitions. [2022-01-19 07:22:42,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1119 transitions, 8002 flow [2022-01-19 07:22:43,568 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 07:22:43,683 INFO L242 Difference]: Finished difference. Result has 959 places, 1078 transitions, 7199 flow [2022-01-19 07:22:43,684 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 07:22:43,684 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2022-01-19 07:22:43,684 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1078 transitions, 7199 flow [2022-01-19 07:22:43,685 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 07:22:43,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:22:43,685 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 07:22:43,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 07:22:43,685 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 07:22:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:22:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2120308048, now seen corresponding path program 1 times [2022-01-19 07:22:43,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:22:43,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735167899] [2022-01-19 07:22:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:22:43,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:22:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:22:43,780 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 07:22:43,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:22:43,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735167899] [2022-01-19 07:22:43,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735167899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:22:43,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:22:43,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:22:43,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126859603] [2022-01-19 07:22:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:22:43,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:22:43,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:22:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:22:43,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:22:43,783 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:22:43,784 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 07:22:43,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:22:43,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:22:43,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:23:06,878 INFO L129 PetriNetUnfolder]: 9968/76017 cut-off events. [2022-01-19 07:23:06,878 INFO L130 PetriNetUnfolder]: For 579542/639740 co-relation queries the response was YES. [2022-01-19 07:23:09,436 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 07:23:09,868 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 354 selfloop transitions, 108 changer transitions 74/1341 dead transitions. [2022-01-19 07:23:09,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 1341 transitions, 12182 flow [2022-01-19 07:23:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 07:23:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 07:23:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8482 transitions. [2022-01-19 07:23:09,871 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906099775664993 [2022-01-19 07:23:09,872 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8482 transitions. [2022-01-19 07:23:09,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8482 transitions. [2022-01-19 07:23:09,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:23:09,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8482 transitions. [2022-01-19 07:23:09,877 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 07:23:09,880 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 07:23:09,881 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 07:23:09,881 INFO L186 Difference]: Start difference. First operand has 959 places, 1078 transitions, 7199 flow. Second operand 11 states and 8482 transitions. [2022-01-19 07:23:09,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 1341 transitions, 12182 flow [2022-01-19 07:23:14,078 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 07:23:14,089 INFO L242 Difference]: Finished difference. Result has 977 places, 1108 transitions, 8590 flow [2022-01-19 07:23:14,089 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 07:23:14,090 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 221 predicate places. [2022-01-19 07:23:14,090 INFO L470 AbstractCegarLoop]: Abstraction has has 977 places, 1108 transitions, 8590 flow [2022-01-19 07:23:14,090 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 07:23:14,090 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:23:14,090 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 07:23:14,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 07:23:14,091 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 07:23:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:23:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash -212299800, now seen corresponding path program 2 times [2022-01-19 07:23:14,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:23:14,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482907353] [2022-01-19 07:23:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:23:14,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:23:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:23:14,166 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 07:23:14,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:23:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482907353] [2022-01-19 07:23:14,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482907353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:23:14,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:23:14,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:23:14,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841840028] [2022-01-19 07:23:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:23:14,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:23:14,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:23:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:23:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:23:14,171 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:23:14,173 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 07:23:14,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:23:14,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:23:14,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:23:42,882 INFO L129 PetriNetUnfolder]: 10420/84409 cut-off events. [2022-01-19 07:23:42,882 INFO L130 PetriNetUnfolder]: For 511901/566181 co-relation queries the response was YES. [2022-01-19 07:23:46,182 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 07:23:46,528 INFO L132 encePairwiseOnDemand]: 833/851 looper letters, 325 selfloop transitions, 110 changer transitions 97/1337 dead transitions. [2022-01-19 07:23:46,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1337 transitions, 11729 flow [2022-01-19 07:23:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 07:23:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 07:23:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6950 transitions. [2022-01-19 07:23:46,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9074291682987335 [2022-01-19 07:23:46,532 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6950 transitions. [2022-01-19 07:23:46,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6950 transitions. [2022-01-19 07:23:46,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:23:46,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6950 transitions. [2022-01-19 07:23:46,536 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 07:23:46,540 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 07:23:46,540 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 07:23:46,540 INFO L186 Difference]: Start difference. First operand has 977 places, 1108 transitions, 8590 flow. Second operand 9 states and 6950 transitions. [2022-01-19 07:23:46,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1337 transitions, 11729 flow [2022-01-19 07:23:51,208 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 07:23:51,218 INFO L242 Difference]: Finished difference. Result has 988 places, 1120 transitions, 8736 flow [2022-01-19 07:23:51,219 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 07:23:51,219 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 232 predicate places. [2022-01-19 07:23:51,219 INFO L470 AbstractCegarLoop]: Abstraction has has 988 places, 1120 transitions, 8736 flow [2022-01-19 07:23:51,220 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 07:23:51,220 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:23:51,220 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 07:23:51,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 07:23:51,220 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 07:23:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:23:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1953128738, now seen corresponding path program 3 times [2022-01-19 07:23:51,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:23:51,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630131001] [2022-01-19 07:23:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:23:51,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:23:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:23:51,305 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 07:23:51,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:23:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630131001] [2022-01-19 07:23:51,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630131001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:23:51,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:23:51,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:23:51,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540648896] [2022-01-19 07:23:51,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:23:51,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:23:51,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:23:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:23:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:23:51,308 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:23:51,310 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 07:23:51,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:23:51,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:23:51,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:24:17,185 INFO L129 PetriNetUnfolder]: 10107/77075 cut-off events. [2022-01-19 07:24:17,185 INFO L130 PetriNetUnfolder]: For 536213/590314 co-relation queries the response was YES. [2022-01-19 07:24:20,396 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 07:24:20,727 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 343 selfloop transitions, 75 changer transitions 17/1240 dead transitions. [2022-01-19 07:24:20,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1240 transitions, 10594 flow [2022-01-19 07:24:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:24:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:24:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6165 transitions. [2022-01-19 07:24:20,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9055522914218567 [2022-01-19 07:24:20,730 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6165 transitions. [2022-01-19 07:24:20,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6165 transitions. [2022-01-19 07:24:20,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:24:20,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6165 transitions. [2022-01-19 07:24:20,734 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 07:24:20,737 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 07:24:20,738 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 07:24:20,738 INFO L186 Difference]: Start difference. First operand has 988 places, 1120 transitions, 8736 flow. Second operand 8 states and 6165 transitions. [2022-01-19 07:24:20,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1240 transitions, 10594 flow [2022-01-19 07:24:25,905 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 07:24:25,916 INFO L242 Difference]: Finished difference. Result has 998 places, 1136 transitions, 9134 flow [2022-01-19 07:24:25,917 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 07:24:25,917 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 242 predicate places. [2022-01-19 07:24:25,917 INFO L470 AbstractCegarLoop]: Abstraction has has 998 places, 1136 transitions, 9134 flow [2022-01-19 07:24:25,918 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 07:24:25,918 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:24:25,918 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 07:24:25,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 07:24:25,918 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 07:24:25,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:24:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1902964794, now seen corresponding path program 4 times [2022-01-19 07:24:25,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:24:25,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381683626] [2022-01-19 07:24:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:24:25,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:24:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:24:26,009 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 07:24:26,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:24:26,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381683626] [2022-01-19 07:24:26,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381683626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:24:26,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:24:26,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:24:26,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976789600] [2022-01-19 07:24:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:24:26,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:24:26,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:24:26,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:24:26,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:24:26,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 851 [2022-01-19 07:24:26,014 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 07:24:26,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:24:26,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 851 [2022-01-19 07:24:26,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:25:01,346 INFO L129 PetriNetUnfolder]: 12624/97793 cut-off events. [2022-01-19 07:25:01,346 INFO L130 PetriNetUnfolder]: For 644388/702317 co-relation queries the response was YES. [2022-01-19 07:25:05,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224155 conditions, 97793 events. 12624/97793 cut-off events. For 644388/702317 co-relation queries the response was YES. Maximal size of possible extension queue 1570. Compared 1612549 event pairs, 3823 based on Foata normal form. 1129/94857 useless extension candidates. Maximal degree in co-relation 224039. Up to 7454 conditions per place. [2022-01-19 07:25:06,182 INFO L132 encePairwiseOnDemand]: 808/851 looper letters, 375 selfloop transitions, 251 changer transitions 81/1510 dead transitions. [2022-01-19 07:25:06,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1510 transitions, 15660 flow [2022-01-19 07:25:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 07:25:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 07:25:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8510 transitions. [2022-01-19 07:25:06,186 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2022-01-19 07:25:06,186 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8510 transitions. [2022-01-19 07:25:06,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8510 transitions. [2022-01-19 07:25:06,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:25:06,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8510 transitions. [2022-01-19 07:25:06,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 773.6363636363636) internal successors, (8510), 11 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 07:25:06,196 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 07:25:06,196 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 07:25:06,196 INFO L186 Difference]: Start difference. First operand has 998 places, 1136 transitions, 9134 flow. Second operand 11 states and 8510 transitions. [2022-01-19 07:25:06,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 1510 transitions, 15660 flow [2022-01-19 07:25:13,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1510 transitions, 15630 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-01-19 07:25:13,406 INFO L242 Difference]: Finished difference. Result has 1016 places, 1250 transitions, 11900 flow [2022-01-19 07:25:13,407 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=9116, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11900, PETRI_PLACES=1016, PETRI_TRANSITIONS=1250} [2022-01-19 07:25:13,407 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 260 predicate places. [2022-01-19 07:25:13,407 INFO L470 AbstractCegarLoop]: Abstraction has has 1016 places, 1250 transitions, 11900 flow [2022-01-19 07:25:13,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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 07:25:13,408 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:25:13,408 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 07:25:13,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 07:25:13,408 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:25:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:25:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash -236582252, now seen corresponding path program 5 times [2022-01-19 07:25:13,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:25:13,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989200807] [2022-01-19 07:25:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:25:13,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:25:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:25:13,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 07:25:13,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:25:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989200807] [2022-01-19 07:25:13,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989200807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:25:13,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:25:13,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:25:13,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7902609] [2022-01-19 07:25:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:25:13,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:25:13,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:25:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:25:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:25:13,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 851 [2022-01-19 07:25:13,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1250 transitions, 11900 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 07:25:13,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:25:13,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 851 [2022-01-19 07:25:13,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:25:52,387 INFO L129 PetriNetUnfolder]: 14208/111331 cut-off events. [2022-01-19 07:25:52,387 INFO L130 PetriNetUnfolder]: For 851192/952253 co-relation queries the response was YES. [2022-01-19 07:25:57,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267160 conditions, 111331 events. 14208/111331 cut-off events. For 851192/952253 co-relation queries the response was YES. Maximal size of possible extension queue 1768. Compared 1876565 event pairs, 4308 based on Foata normal form. 732/107068 useless extension candidates. Maximal degree in co-relation 267036. Up to 7096 conditions per place. [2022-01-19 07:25:57,826 INFO L132 encePairwiseOnDemand]: 832/851 looper letters, 490 selfloop transitions, 111 changer transitions 31/1435 dead transitions. [2022-01-19 07:25:57,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1435 transitions, 15496 flow [2022-01-19 07:25:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:25:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:25:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5426 transitions. [2022-01-19 07:25:57,828 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910861171730737 [2022-01-19 07:25:57,828 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5426 transitions. [2022-01-19 07:25:57,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5426 transitions. [2022-01-19 07:25:57,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:25:57,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5426 transitions. [2022-01-19 07:25:57,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 775.1428571428571) internal successors, (5426), 7 states have internal predecessors, (5426), 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 07:25:57,834 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 07:25:57,835 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 07:25:57,835 INFO L186 Difference]: Start difference. First operand has 1016 places, 1250 transitions, 11900 flow. Second operand 7 states and 5426 transitions. [2022-01-19 07:25:57,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1435 transitions, 15496 flow [2022-01-19 07:26:08,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1435 transitions, 15339 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-01-19 07:26:08,585 INFO L242 Difference]: Finished difference. Result has 1021 places, 1267 transitions, 12689 flow [2022-01-19 07:26:08,586 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=11773, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12689, PETRI_PLACES=1021, PETRI_TRANSITIONS=1267} [2022-01-19 07:26:08,586 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 265 predicate places. [2022-01-19 07:26:08,586 INFO L470 AbstractCegarLoop]: Abstraction has has 1021 places, 1267 transitions, 12689 flow [2022-01-19 07:26:08,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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 07:26:08,587 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:26:08,587 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 07:26:08,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 07:26:08,587 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:26:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:26:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash -298215338, now seen corresponding path program 6 times [2022-01-19 07:26:08,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:26:08,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130385505] [2022-01-19 07:26:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:26:08,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:26:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:26:08,680 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 07:26:08,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:26:08,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130385505] [2022-01-19 07:26:08,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130385505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:26:08,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:26:08,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:26:08,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504806588] [2022-01-19 07:26:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:26:08,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:26:08,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:26:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:26:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:26:08,683 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 07:26:08,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1267 transitions, 12689 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 07:26:08,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:26:08,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 07:26:08,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand