/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:48:47,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:48:48,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:48:48,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:48:48,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:48:48,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:48:48,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:48:48,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:48:48,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:48:48,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:48:48,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:48:48,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:48:48,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:48:48,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:48:48,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:48:48,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:48:48,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:48:48,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:48:48,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:48:48,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:48:48,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:48:48,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:48:48,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:48:48,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:48:48,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:48:48,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:48:48,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:48:48,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:48:48,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:48:48,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:48:48,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:48:48,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:48:48,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:48:48,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:48:48,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:48:48,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:48:48,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:48:48,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:48:48,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:48:48,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:48:48,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:48:48,086 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.epf [2022-01-19 00:48:48,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:48:48,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:48:48,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:48:48,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:48:48,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:48:48,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:48:48,115 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:48:48,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:48:48,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:48:48,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:48:48,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:48:48,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:48:48,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:48:48,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:48:48,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:48:48,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:48:48,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:48:48,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:48:48,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:48:48,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:48:48,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:48:48,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:48:48,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:48:48,118 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:48:48,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:48:48,118 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 00:48:48,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:48:48,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:48:48,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:48:48,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:48:48,355 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:48:48,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2022-01-19 00:48:48,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16c31237/ff81e006532e4b43a638f2855e2fa1ea/FLAG7b0b1cd9b [2022-01-19 00:48:48,787 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:48:48,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2022-01-19 00:48:48,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16c31237/ff81e006532e4b43a638f2855e2fa1ea/FLAG7b0b1cd9b [2022-01-19 00:48:48,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16c31237/ff81e006532e4b43a638f2855e2fa1ea [2022-01-19 00:48:48,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:48:48,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:48:48,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:48:48,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:48:48,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:48:48,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:48:48" (1/1) ... [2022-01-19 00:48:48,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffce129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:48, skipping insertion in model container [2022-01-19 00:48:48,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:48:48" (1/1) ... [2022-01-19 00:48:48,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:48:48,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:48:49,080 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-symm.wvr.c[4929,4942] [2022-01-19 00:48:49,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:48:49,104 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:48:49,142 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-symm.wvr.c[4929,4942] [2022-01-19 00:48:49,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:48:49,174 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:48:49,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49 WrapperNode [2022-01-19 00:48:49,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:48:49,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:48:49,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:48:49,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:48:49,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,227 INFO L137 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 452 [2022-01-19 00:48:49,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:48:49,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:48:49,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:48:49,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:48:49,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:48:49,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:48:49,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:48:49,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:48:49,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (1/1) ... [2022-01-19 00:48:49,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:48:49,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:48:49,293 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 00:48:49,295 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 00:48:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:48:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:48:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:48:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:48:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:48:49,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:48:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:48:49,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:48:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:48:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 00:48:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:48:49,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:48:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:48:49,323 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 00:48:49,437 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:48:49,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:48:49,884 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:48:49,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:48:49,894 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 00:48:49,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:48:49 BoogieIcfgContainer [2022-01-19 00:48:49,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:48:49,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:48:49,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:48:49,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:48:49,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:48:48" (1/3) ... [2022-01-19 00:48:49,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66315707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:48:49, skipping insertion in model container [2022-01-19 00:48:49,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:48:49" (2/3) ... [2022-01-19 00:48:49,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66315707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:48:49, skipping insertion in model container [2022-01-19 00:48:49,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:48:49" (3/3) ... [2022-01-19 00:48:49,903 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2022-01-19 00:48:49,910 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:48:49,910 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:48:49,910 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:48:50,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,043 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,044 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,045 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,046 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,047 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,047 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,047 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,047 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,047 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,047 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,050 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,051 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,051 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,051 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,051 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,051 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,051 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,060 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,061 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,062 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,063 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,063 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,063 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,063 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,063 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,063 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,064 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,064 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,064 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,064 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,064 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,064 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,065 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,066 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,066 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,066 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,066 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,066 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,067 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,068 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,069 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,069 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,069 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,069 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,069 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,069 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,080 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,081 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,082 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,083 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,084 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,085 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,090 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,090 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,093 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,103 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,103 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,103 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,103 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,103 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,103 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,106 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,108 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,123 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:48:50,152 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 00:48:50,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:48:50,217 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 00:48:50,217 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 00:48:50,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 538 places, 596 transitions, 1208 flow [2022-01-19 00:48:50,487 INFO L129 PetriNetUnfolder]: 65/594 cut-off events. [2022-01-19 00:48:50,487 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:48:50,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 594 events. 65/594 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1760 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2022-01-19 00:48:50,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 538 places, 596 transitions, 1208 flow [2022-01-19 00:48:50,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 527 places, 585 transitions, 1182 flow [2022-01-19 00:48:50,602 INFO L129 PetriNetUnfolder]: 57/538 cut-off events. [2022-01-19 00:48:50,602 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:48:50,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:50,603 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] [2022-01-19 00:48:50,604 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 957133029, now seen corresponding path program 1 times [2022-01-19 00:48:50,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159114363] [2022-01-19 00:48:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:50,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:50,922 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 00:48:50,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:50,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159114363] [2022-01-19 00:48:50,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159114363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:50,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:50,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 00:48:50,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496852321] [2022-01-19 00:48:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:50,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 00:48:50,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 00:48:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 00:48:50,967 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 596 [2022-01-19 00:48:50,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 585 transitions, 1182 flow. Second operand has 2 states, 2 states have (on average 568.5) internal successors, (1137), 2 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:50,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:50,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 596 [2022-01-19 00:48:50,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:51,136 INFO L129 PetriNetUnfolder]: 40/560 cut-off events. [2022-01-19 00:48:51,136 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-01-19 00:48:51,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 560 events. 40/560 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1694 event pairs, 0 based on Foata normal form. 30/529 useless extension candidates. Maximal degree in co-relation 396. Up to 5 conditions per place. [2022-01-19 00:48:51,149 INFO L132 encePairwiseOnDemand]: 571/596 looper letters, 4 selfloop transitions, 0 changer transitions 5/560 dead transitions. [2022-01-19 00:48:51,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 560 transitions, 1140 flow [2022-01-19 00:48:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 00:48:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 00:48:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1161 transitions. [2022-01-19 00:48:51,168 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9739932885906041 [2022-01-19 00:48:51,168 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1161 transitions. [2022-01-19 00:48:51,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1161 transitions. [2022-01-19 00:48:51,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:51,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1161 transitions. [2022-01-19 00:48:51,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 580.5) internal successors, (1161), 2 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 596.0) internal successors, (1788), 3 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,195 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 596.0) internal successors, (1788), 3 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,197 INFO L186 Difference]: Start difference. First operand has 527 places, 585 transitions, 1182 flow. Second operand 2 states and 1161 transitions. [2022-01-19 00:48:51,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 560 transitions, 1140 flow [2022-01-19 00:48:51,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 560 transitions, 1132 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 00:48:51,219 INFO L242 Difference]: Finished difference. Result has 524 places, 555 transitions, 1114 flow [2022-01-19 00:48:51,221 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1114, PETRI_PLACES=524, PETRI_TRANSITIONS=555} [2022-01-19 00:48:51,225 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, -3 predicate places. [2022-01-19 00:48:51,226 INFO L470 AbstractCegarLoop]: Abstraction has has 524 places, 555 transitions, 1114 flow [2022-01-19 00:48:51,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 568.5) internal successors, (1137), 2 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,226 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:51,227 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] [2022-01-19 00:48:51,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:48:51,227 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 473457702, now seen corresponding path program 1 times [2022-01-19 00:48:51,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:51,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751098966] [2022-01-19 00:48:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:51,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:51,432 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 00:48:51,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751098966] [2022-01-19 00:48:51,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751098966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:51,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:51,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:48:51,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151510873] [2022-01-19 00:48:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:51,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:48:51,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:51,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:48:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:48:51,440 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 596 [2022-01-19 00:48:51,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 555 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:51,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 596 [2022-01-19 00:48:51,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:51,867 INFO L129 PetriNetUnfolder]: 177/1911 cut-off events. [2022-01-19 00:48:51,867 INFO L130 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-01-19 00:48:51,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 1911 events. 177/1911 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 14008 event pairs, 36 based on Foata normal form. 1/1696 useless extension candidates. Maximal degree in co-relation 2047. Up to 87 conditions per place. [2022-01-19 00:48:51,889 INFO L132 encePairwiseOnDemand]: 590/596 looper letters, 27 selfloop transitions, 4 changer transitions 0/568 dead transitions. [2022-01-19 00:48:51,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 568 transitions, 1205 flow [2022-01-19 00:48:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:48:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:48:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2022-01-19 00:48:51,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9446308724832215 [2022-01-19 00:48:51,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1689 transitions. [2022-01-19 00:48:51,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1689 transitions. [2022-01-19 00:48:51,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:51,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1689 transitions. [2022-01-19 00:48:51,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,903 INFO L186 Difference]: Start difference. First operand has 524 places, 555 transitions, 1114 flow. Second operand 3 states and 1689 transitions. [2022-01-19 00:48:51,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 568 transitions, 1205 flow [2022-01-19 00:48:51,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 568 transitions, 1205 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:48:51,915 INFO L242 Difference]: Finished difference. Result has 523 places, 557 transitions, 1142 flow [2022-01-19 00:48:51,915 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=523, PETRI_TRANSITIONS=557} [2022-01-19 00:48:51,916 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, -4 predicate places. [2022-01-19 00:48:51,917 INFO L470 AbstractCegarLoop]: Abstraction has has 523 places, 557 transitions, 1142 flow [2022-01-19 00:48:51,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:51,918 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:51,918 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] [2022-01-19 00:48:51,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:48:51,918 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1593023258, now seen corresponding path program 2 times [2022-01-19 00:48:51,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:51,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104373951] [2022-01-19 00:48:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:51,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:52,031 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 00:48:52,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:52,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104373951] [2022-01-19 00:48:52,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104373951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:52,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:52,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:48:52,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883726046] [2022-01-19 00:48:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:52,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:48:52,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:48:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:48:52,037 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 596 [2022-01-19 00:48:52,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 557 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:52,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 596 [2022-01-19 00:48:52,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:52,470 INFO L129 PetriNetUnfolder]: 168/1861 cut-off events. [2022-01-19 00:48:52,471 INFO L130 PetriNetUnfolder]: For 77/82 co-relation queries the response was YES. [2022-01-19 00:48:52,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1861 events. 168/1861 cut-off events. For 77/82 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 13758 event pairs, 39 based on Foata normal form. 4/1689 useless extension candidates. Maximal degree in co-relation 2053. Up to 100 conditions per place. [2022-01-19 00:48:52,485 INFO L132 encePairwiseOnDemand]: 590/596 looper letters, 29 selfloop transitions, 4 changer transitions 0/570 dead transitions. [2022-01-19 00:48:52,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 570 transitions, 1241 flow [2022-01-19 00:48:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:48:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:48:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2022-01-19 00:48:52,490 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9446308724832215 [2022-01-19 00:48:52,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1689 transitions. [2022-01-19 00:48:52,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1689 transitions. [2022-01-19 00:48:52,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:52,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1689 transitions. [2022-01-19 00:48:52,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,499 INFO L186 Difference]: Start difference. First operand has 523 places, 557 transitions, 1142 flow. Second operand 3 states and 1689 transitions. [2022-01-19 00:48:52,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 570 transitions, 1241 flow [2022-01-19 00:48:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 570 transitions, 1233 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:48:52,512 INFO L242 Difference]: Finished difference. Result has 525 places, 559 transitions, 1166 flow [2022-01-19 00:48:52,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=525, PETRI_TRANSITIONS=559} [2022-01-19 00:48:52,515 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, -2 predicate places. [2022-01-19 00:48:52,515 INFO L470 AbstractCegarLoop]: Abstraction has has 525 places, 559 transitions, 1166 flow [2022-01-19 00:48:52,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,516 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:52,516 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] [2022-01-19 00:48:52,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:48:52,516 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1976754200, now seen corresponding path program 1 times [2022-01-19 00:48:52,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:52,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943013491] [2022-01-19 00:48:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:52,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:52,645 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 00:48:52,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:52,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943013491] [2022-01-19 00:48:52,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943013491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:52,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:52,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:48:52,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712330733] [2022-01-19 00:48:52,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:52,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:48:52,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:52,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:48:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:48:52,651 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 596 [2022-01-19 00:48:52,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 559 transitions, 1166 flow. Second operand has 5 states, 5 states have (on average 547.6) internal successors, (2738), 5 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:52,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 596 [2022-01-19 00:48:52,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:52,833 INFO L129 PetriNetUnfolder]: 50/678 cut-off events. [2022-01-19 00:48:52,833 INFO L130 PetriNetUnfolder]: For 23/39 co-relation queries the response was YES. [2022-01-19 00:48:52,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 678 events. 50/678 cut-off events. For 23/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2596 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 744. Up to 31 conditions per place. [2022-01-19 00:48:52,845 INFO L132 encePairwiseOnDemand]: 586/596 looper letters, 26 selfloop transitions, 8 changer transitions 0/567 dead transitions. [2022-01-19 00:48:52,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 567 transitions, 1250 flow [2022-01-19 00:48:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:48:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:48:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2756 transitions. [2022-01-19 00:48:52,850 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9248322147651007 [2022-01-19 00:48:52,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2756 transitions. [2022-01-19 00:48:52,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2756 transitions. [2022-01-19 00:48:52,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:52,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2756 transitions. [2022-01-19 00:48:52,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 551.2) internal successors, (2756), 5 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,864 INFO L186 Difference]: Start difference. First operand has 525 places, 559 transitions, 1166 flow. Second operand 5 states and 2756 transitions. [2022-01-19 00:48:52,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 567 transitions, 1250 flow [2022-01-19 00:48:52,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 567 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:48:52,876 INFO L242 Difference]: Finished difference. Result has 528 places, 561 transitions, 1190 flow [2022-01-19 00:48:52,877 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1190, PETRI_PLACES=528, PETRI_TRANSITIONS=561} [2022-01-19 00:48:52,878 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1 predicate places. [2022-01-19 00:48:52,878 INFO L470 AbstractCegarLoop]: Abstraction has has 528 places, 561 transitions, 1190 flow [2022-01-19 00:48:52,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.6) internal successors, (2738), 5 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:52,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:52,880 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] [2022-01-19 00:48:52,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:48:52,881 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1612412822, now seen corresponding path program 1 times [2022-01-19 00:48:52,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:52,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541222746] [2022-01-19 00:48:52,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:52,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 00:48:53,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541222746] [2022-01-19 00:48:53,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541222746] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:48:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590784206] [2022-01-19 00:48:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:53,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:48:53,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:48:53,020 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 00:48:53,034 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 00:48:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:53,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 00:48:53,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:48:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 00:48:53,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:48:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 00:48:53,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590784206] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:48:53,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:48:53,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-01-19 00:48:53,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457486058] [2022-01-19 00:48:53,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:48:53,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 00:48:53,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 00:48:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-19 00:48:53,934 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 596 [2022-01-19 00:48:53,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 561 transitions, 1190 flow. Second operand has 15 states, 15 states have (on average 545.1333333333333) internal successors, (8177), 15 states have internal predecessors, (8177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:53,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:53,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 596 [2022-01-19 00:48:53,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:54,256 INFO L129 PetriNetUnfolder]: 50/694 cut-off events. [2022-01-19 00:48:54,256 INFO L130 PetriNetUnfolder]: For 23/39 co-relation queries the response was YES. [2022-01-19 00:48:54,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 694 events. 50/694 cut-off events. For 23/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2562 event pairs, 0 based on Foata normal form. 4/637 useless extension candidates. Maximal degree in co-relation 788. Up to 25 conditions per place. [2022-01-19 00:48:54,269 INFO L132 encePairwiseOnDemand]: 580/596 looper letters, 28 selfloop transitions, 22 changer transitions 0/581 dead transitions. [2022-01-19 00:48:54,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 581 transitions, 1334 flow [2022-01-19 00:48:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:48:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:48:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6016 transitions. [2022-01-19 00:48:54,282 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9176327028676022 [2022-01-19 00:48:54,282 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6016 transitions. [2022-01-19 00:48:54,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6016 transitions. [2022-01-19 00:48:54,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:54,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6016 transitions. [2022-01-19 00:48:54,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 546.9090909090909) internal successors, (6016), 11 states have internal predecessors, (6016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:54,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 596.0) internal successors, (7152), 12 states have internal predecessors, (7152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:54,345 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 596.0) internal successors, (7152), 12 states have internal predecessors, (7152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:54,345 INFO L186 Difference]: Start difference. First operand has 528 places, 561 transitions, 1190 flow. Second operand 11 states and 6016 transitions. [2022-01-19 00:48:54,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 581 transitions, 1334 flow [2022-01-19 00:48:54,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 581 transitions, 1322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 00:48:54,356 INFO L242 Difference]: Finished difference. Result has 538 places, 573 transitions, 1289 flow [2022-01-19 00:48:54,358 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1289, PETRI_PLACES=538, PETRI_TRANSITIONS=573} [2022-01-19 00:48:54,358 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 11 predicate places. [2022-01-19 00:48:54,358 INFO L470 AbstractCegarLoop]: Abstraction has has 538 places, 573 transitions, 1289 flow [2022-01-19 00:48:54,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 545.1333333333333) internal successors, (8177), 15 states have internal predecessors, (8177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:54,361 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:54,361 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:54,392 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 00:48:54,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:48:54,576 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash -226902670, now seen corresponding path program 2 times [2022-01-19 00:48:54,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:54,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614420763] [2022-01-19 00:48:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:54,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 00:48:54,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:54,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614420763] [2022-01-19 00:48:54,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614420763] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:48:54,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60887768] [2022-01-19 00:48:54,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 00:48:54,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:48:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:48:54,694 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 00:48:54,705 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 00:48:54,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 00:48:54,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:48:54,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 00:48:54,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:48:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 00:48:55,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 00:48:55,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60887768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:55,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 00:48:55,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 00:48:55,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421436131] [2022-01-19 00:48:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:55,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:48:55,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:55,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:48:55,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 00:48:55,153 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 596 [2022-01-19 00:48:55,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 573 transitions, 1289 flow. Second operand has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:55,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:55,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 596 [2022-01-19 00:48:55,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:55,467 INFO L129 PetriNetUnfolder]: 149/1715 cut-off events. [2022-01-19 00:48:55,467 INFO L130 PetriNetUnfolder]: For 31/60 co-relation queries the response was YES. [2022-01-19 00:48:55,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 1715 events. 149/1715 cut-off events. For 31/60 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10572 event pairs, 17 based on Foata normal form. 10/1550 useless extension candidates. Maximal degree in co-relation 1920. Up to 76 conditions per place. [2022-01-19 00:48:55,488 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 33 selfloop transitions, 5 changer transitions 0/586 dead transitions. [2022-01-19 00:48:55,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 586 transitions, 1398 flow [2022-01-19 00:48:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:48:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:48:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3855 transitions. [2022-01-19 00:48:55,496 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240172579098753 [2022-01-19 00:48:55,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3855 transitions. [2022-01-19 00:48:55,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3855 transitions. [2022-01-19 00:48:55,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:55,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3855 transitions. [2022-01-19 00:48:55,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 550.7142857142857) internal successors, (3855), 7 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:55,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:55,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:55,510 INFO L186 Difference]: Start difference. First operand has 538 places, 573 transitions, 1289 flow. Second operand 7 states and 3855 transitions. [2022-01-19 00:48:55,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 586 transitions, 1398 flow [2022-01-19 00:48:55,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 586 transitions, 1381 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 00:48:55,523 INFO L242 Difference]: Finished difference. Result has 546 places, 577 transitions, 1311 flow [2022-01-19 00:48:55,523 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1311, PETRI_PLACES=546, PETRI_TRANSITIONS=577} [2022-01-19 00:48:55,524 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 19 predicate places. [2022-01-19 00:48:55,524 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 577 transitions, 1311 flow [2022-01-19 00:48:55,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:55,525 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:55,525 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:55,556 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 00:48:55,747 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,SelfDestructingSolverStorable5 [2022-01-19 00:48:55,748 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 755089234, now seen corresponding path program 1 times [2022-01-19 00:48:55,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:55,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802028558] [2022-01-19 00:48:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:55,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 00:48:55,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802028558] [2022-01-19 00:48:55,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802028558] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:48:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819320723] [2022-01-19 00:48:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:55,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:48:55,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:48:55,874 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 00:48:55,901 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 00:48:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:56,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 00:48:56,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:48:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 00:48:56,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:48:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 00:48:56,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819320723] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:48:56,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:48:56,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-01-19 00:48:56,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609320588] [2022-01-19 00:48:56,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:48:56,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 00:48:56,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 00:48:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-01-19 00:48:56,766 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 596 [2022-01-19 00:48:56,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 577 transitions, 1311 flow. Second operand has 22 states, 22 states have (on average 545.0454545454545) internal successors, (11991), 22 states have internal predecessors, (11991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:56,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:56,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 596 [2022-01-19 00:48:56,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:57,152 INFO L129 PetriNetUnfolder]: 51/742 cut-off events. [2022-01-19 00:48:57,152 INFO L130 PetriNetUnfolder]: For 51/67 co-relation queries the response was YES. [2022-01-19 00:48:57,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 742 events. 51/742 cut-off events. For 51/67 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2749 event pairs, 0 based on Foata normal form. 4/689 useless extension candidates. Maximal degree in co-relation 933. Up to 25 conditions per place. [2022-01-19 00:48:57,165 INFO L132 encePairwiseOnDemand]: 580/596 looper letters, 36 selfloop transitions, 34 changer transitions 0/605 dead transitions. [2022-01-19 00:48:57,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 605 transitions, 1563 flow [2022-01-19 00:48:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:48:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:48:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 9288 transitions. [2022-01-19 00:48:57,181 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9166995657323332 [2022-01-19 00:48:57,181 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 9288 transitions. [2022-01-19 00:48:57,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 9288 transitions. [2022-01-19 00:48:57,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:57,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 9288 transitions. [2022-01-19 00:48:57,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 546.3529411764706) internal successors, (9288), 17 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 596.0) internal successors, (10728), 18 states have internal predecessors, (10728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,220 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 596.0) internal successors, (10728), 18 states have internal predecessors, (10728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,220 INFO L186 Difference]: Start difference. First operand has 546 places, 577 transitions, 1311 flow. Second operand 17 states and 9288 transitions. [2022-01-19 00:48:57,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 605 transitions, 1563 flow [2022-01-19 00:48:57,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 605 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:48:57,233 INFO L242 Difference]: Finished difference. Result has 564 places, 591 transitions, 1485 flow [2022-01-19 00:48:57,234 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1485, PETRI_PLACES=564, PETRI_TRANSITIONS=591} [2022-01-19 00:48:57,235 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 37 predicate places. [2022-01-19 00:48:57,235 INFO L470 AbstractCegarLoop]: Abstraction has has 564 places, 591 transitions, 1485 flow [2022-01-19 00:48:57,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 545.0454545454545) internal successors, (11991), 22 states have internal predecessors, (11991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,238 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:57,238 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:57,265 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 00:48:57,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:48:57,452 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -565416218, now seen corresponding path program 2 times [2022-01-19 00:48:57,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:57,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925819485] [2022-01-19 00:48:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:57,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:48:57,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:57,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925819485] [2022-01-19 00:48:57,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925819485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:57,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:57,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:48:57,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843286645] [2022-01-19 00:48:57,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:57,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:48:57,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:48:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:48:57,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 596 [2022-01-19 00:48:57,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 591 transitions, 1485 flow. Second operand has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:57,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 596 [2022-01-19 00:48:57,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:57,808 INFO L129 PetriNetUnfolder]: 151/1280 cut-off events. [2022-01-19 00:48:57,808 INFO L130 PetriNetUnfolder]: For 112/122 co-relation queries the response was YES. [2022-01-19 00:48:57,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1280 events. 151/1280 cut-off events. For 112/122 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6500 event pairs, 37 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 1618. Up to 140 conditions per place. [2022-01-19 00:48:57,825 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 32 selfloop transitions, 5 changer transitions 0/603 dead transitions. [2022-01-19 00:48:57,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 603 transitions, 1589 flow [2022-01-19 00:48:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:48:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:48:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3854 transitions. [2022-01-19 00:48:57,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.923777564717162 [2022-01-19 00:48:57,874 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3854 transitions. [2022-01-19 00:48:57,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3854 transitions. [2022-01-19 00:48:57,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:57,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3854 transitions. [2022-01-19 00:48:57,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 550.5714285714286) internal successors, (3854), 7 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,893 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,894 INFO L186 Difference]: Start difference. First operand has 564 places, 591 transitions, 1485 flow. Second operand 7 states and 3854 transitions. [2022-01-19 00:48:57,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 603 transitions, 1589 flow [2022-01-19 00:48:57,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 603 transitions, 1544 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-01-19 00:48:57,904 INFO L242 Difference]: Finished difference. Result has 567 places, 595 transitions, 1479 flow [2022-01-19 00:48:57,905 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1479, PETRI_PLACES=567, PETRI_TRANSITIONS=595} [2022-01-19 00:48:57,908 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 40 predicate places. [2022-01-19 00:48:57,908 INFO L470 AbstractCegarLoop]: Abstraction has has 567 places, 595 transitions, 1479 flow [2022-01-19 00:48:57,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:57,909 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:57,909 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:57,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:48:57,909 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 514282158, now seen corresponding path program 1 times [2022-01-19 00:48:57,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530206602] [2022-01-19 00:48:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:57,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:48:58,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:58,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530206602] [2022-01-19 00:48:58,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530206602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:58,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:58,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:48:58,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632490394] [2022-01-19 00:48:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:58,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:48:58,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:48:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:48:58,033 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 596 [2022-01-19 00:48:58,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 595 transitions, 1479 flow. Second operand has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:58,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 596 [2022-01-19 00:48:58,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:58,288 INFO L129 PetriNetUnfolder]: 54/846 cut-off events. [2022-01-19 00:48:58,288 INFO L130 PetriNetUnfolder]: For 71/87 co-relation queries the response was YES. [2022-01-19 00:48:58,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 846 events. 54/846 cut-off events. For 71/87 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3623 event pairs, 0 based on Foata normal form. 4/801 useless extension candidates. Maximal degree in co-relation 1174. Up to 83 conditions per place. [2022-01-19 00:48:58,300 INFO L132 encePairwiseOnDemand]: 588/596 looper letters, 38 selfloop transitions, 4 changer transitions 4/607 dead transitions. [2022-01-19 00:48:58,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 607 transitions, 1595 flow [2022-01-19 00:48:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:48:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:48:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3764 transitions. [2022-01-19 00:48:58,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9022051773729626 [2022-01-19 00:48:58,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3764 transitions. [2022-01-19 00:48:58,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3764 transitions. [2022-01-19 00:48:58,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:58,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3764 transitions. [2022-01-19 00:48:58,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 537.7142857142857) internal successors, (3764), 7 states have internal predecessors, (3764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,326 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,326 INFO L186 Difference]: Start difference. First operand has 567 places, 595 transitions, 1479 flow. Second operand 7 states and 3764 transitions. [2022-01-19 00:48:58,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 607 transitions, 1595 flow [2022-01-19 00:48:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 607 transitions, 1594 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:48:58,337 INFO L242 Difference]: Finished difference. Result has 577 places, 598 transitions, 1512 flow [2022-01-19 00:48:58,338 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1512, PETRI_PLACES=577, PETRI_TRANSITIONS=598} [2022-01-19 00:48:58,339 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 50 predicate places. [2022-01-19 00:48:58,339 INFO L470 AbstractCegarLoop]: Abstraction has has 577 places, 598 transitions, 1512 flow [2022-01-19 00:48:58,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,340 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:58,340 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:58,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:48:58,341 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1134371698, now seen corresponding path program 1 times [2022-01-19 00:48:58,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774570270] [2022-01-19 00:48:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:58,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:48:58,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:58,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774570270] [2022-01-19 00:48:58,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774570270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:58,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:58,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:48:58,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285346719] [2022-01-19 00:48:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:58,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:48:58,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:48:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:48:58,449 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 596 [2022-01-19 00:48:58,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 598 transitions, 1512 flow. Second operand has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:58,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 596 [2022-01-19 00:48:58,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:58,710 INFO L129 PetriNetUnfolder]: 56/894 cut-off events. [2022-01-19 00:48:58,710 INFO L130 PetriNetUnfolder]: For 127/143 co-relation queries the response was YES. [2022-01-19 00:48:58,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 894 events. 56/894 cut-off events. For 127/143 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4025 event pairs, 0 based on Foata normal form. 4/849 useless extension candidates. Maximal degree in co-relation 1359. Up to 125 conditions per place. [2022-01-19 00:48:58,722 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 42 selfloop transitions, 2 changer transitions 5/611 dead transitions. [2022-01-19 00:48:58,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 611 transitions, 1650 flow [2022-01-19 00:48:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:48:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:48:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3765 transitions. [2022-01-19 00:48:58,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9024448705656759 [2022-01-19 00:48:58,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3765 transitions. [2022-01-19 00:48:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3765 transitions. [2022-01-19 00:48:58,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:58,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3765 transitions. [2022-01-19 00:48:58,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 537.8571428571429) internal successors, (3765), 7 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,744 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,744 INFO L186 Difference]: Start difference. First operand has 577 places, 598 transitions, 1512 flow. Second operand 7 states and 3765 transitions. [2022-01-19 00:48:58,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 611 transitions, 1650 flow [2022-01-19 00:48:58,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 611 transitions, 1632 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-01-19 00:48:58,757 INFO L242 Difference]: Finished difference. Result has 581 places, 599 transitions, 1526 flow [2022-01-19 00:48:58,758 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1526, PETRI_PLACES=581, PETRI_TRANSITIONS=599} [2022-01-19 00:48:58,758 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 54 predicate places. [2022-01-19 00:48:58,758 INFO L470 AbstractCegarLoop]: Abstraction has has 581 places, 599 transitions, 1526 flow [2022-01-19 00:48:58,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:58,759 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:58,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 00:48:58,760 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1515986788, now seen corresponding path program 1 times [2022-01-19 00:48:58,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:58,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135074602] [2022-01-19 00:48:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:58,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:48:58,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135074602] [2022-01-19 00:48:58,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135074602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:58,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:58,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:48:58,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325366164] [2022-01-19 00:48:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:58,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:48:58,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:48:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:48:58,812 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 596 [2022-01-19 00:48:58,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 599 transitions, 1526 flow. Second operand has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:58,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:58,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 596 [2022-01-19 00:48:58,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:59,103 INFO L129 PetriNetUnfolder]: 137/1358 cut-off events. [2022-01-19 00:48:59,103 INFO L130 PetriNetUnfolder]: For 151/163 co-relation queries the response was YES. [2022-01-19 00:48:59,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1358 events. 137/1358 cut-off events. For 151/163 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7135 event pairs, 30 based on Foata normal form. 6/1238 useless extension candidates. Maximal degree in co-relation 1856. Up to 139 conditions per place. [2022-01-19 00:48:59,115 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 29 selfloop transitions, 3 changer transitions 2/606 dead transitions. [2022-01-19 00:48:59,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 606 transitions, 1614 flow [2022-01-19 00:48:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:48:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:48:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2770 transitions. [2022-01-19 00:48:59,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9295302013422819 [2022-01-19 00:48:59,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2770 transitions. [2022-01-19 00:48:59,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2770 transitions. [2022-01-19 00:48:59,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:59,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2770 transitions. [2022-01-19 00:48:59,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 554.0) internal successors, (2770), 5 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,129 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,129 INFO L186 Difference]: Start difference. First operand has 581 places, 599 transitions, 1526 flow. Second operand 5 states and 2770 transitions. [2022-01-19 00:48:59,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 606 transitions, 1614 flow [2022-01-19 00:48:59,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 606 transitions, 1604 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-01-19 00:48:59,140 INFO L242 Difference]: Finished difference. Result has 579 places, 599 transitions, 1529 flow [2022-01-19 00:48:59,141 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1529, PETRI_PLACES=579, PETRI_TRANSITIONS=599} [2022-01-19 00:48:59,141 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 52 predicate places. [2022-01-19 00:48:59,141 INFO L470 AbstractCegarLoop]: Abstraction has has 579 places, 599 transitions, 1529 flow [2022-01-19 00:48:59,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,142 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:59,142 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:59,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:48:59,142 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1405245386, now seen corresponding path program 1 times [2022-01-19 00:48:59,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:59,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746558334] [2022-01-19 00:48:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:59,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:48:59,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746558334] [2022-01-19 00:48:59,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746558334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:59,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:59,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:48:59,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911564402] [2022-01-19 00:48:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:59,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:48:59,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:48:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:48:59,196 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 596 [2022-01-19 00:48:59,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 599 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:59,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 596 [2022-01-19 00:48:59,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:59,522 INFO L129 PetriNetUnfolder]: 136/1792 cut-off events. [2022-01-19 00:48:59,522 INFO L130 PetriNetUnfolder]: For 117/140 co-relation queries the response was YES. [2022-01-19 00:48:59,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 1792 events. 136/1792 cut-off events. For 117/140 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11181 event pairs, 14 based on Foata normal form. 8/1639 useless extension candidates. Maximal degree in co-relation 2246. Up to 69 conditions per place. [2022-01-19 00:48:59,545 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 30 selfloop transitions, 3 changer transitions 2/607 dead transitions. [2022-01-19 00:48:59,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 607 transitions, 1622 flow [2022-01-19 00:48:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:48:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:48:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2771 transitions. [2022-01-19 00:48:59,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9298657718120805 [2022-01-19 00:48:59,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2771 transitions. [2022-01-19 00:48:59,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2771 transitions. [2022-01-19 00:48:59,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:59,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2771 transitions. [2022-01-19 00:48:59,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 554.2) internal successors, (2771), 5 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,557 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,557 INFO L186 Difference]: Start difference. First operand has 579 places, 599 transitions, 1529 flow. Second operand 5 states and 2771 transitions. [2022-01-19 00:48:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 607 transitions, 1622 flow [2022-01-19 00:48:59,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 607 transitions, 1613 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:48:59,569 INFO L242 Difference]: Finished difference. Result has 584 places, 599 transitions, 1537 flow [2022-01-19 00:48:59,570 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1537, PETRI_PLACES=584, PETRI_TRANSITIONS=599} [2022-01-19 00:48:59,570 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 57 predicate places. [2022-01-19 00:48:59,570 INFO L470 AbstractCegarLoop]: Abstraction has has 584 places, 599 transitions, 1537 flow [2022-01-19 00:48:59,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,571 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:59,571 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:59,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:48:59,571 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash -186903562, now seen corresponding path program 1 times [2022-01-19 00:48:59,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:59,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121503197] [2022-01-19 00:48:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:59,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:48:59,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:59,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121503197] [2022-01-19 00:48:59,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121503197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:59,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:59,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:48:59,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043177881] [2022-01-19 00:48:59,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:59,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:48:59,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:59,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:48:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:48:59,634 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 596 [2022-01-19 00:48:59,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 599 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:59,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 596 [2022-01-19 00:48:59,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:59,955 INFO L129 PetriNetUnfolder]: 159/1654 cut-off events. [2022-01-19 00:48:59,955 INFO L130 PetriNetUnfolder]: For 141/159 co-relation queries the response was YES. [2022-01-19 00:48:59,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 1654 events. 159/1654 cut-off events. For 141/159 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10239 event pairs, 36 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 2094. Up to 111 conditions per place. [2022-01-19 00:48:59,976 INFO L132 encePairwiseOnDemand]: 591/596 looper letters, 24 selfloop transitions, 4 changer transitions 0/606 dead transitions. [2022-01-19 00:48:59,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 606 transitions, 1609 flow [2022-01-19 00:48:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:48:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:48:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2022-01-19 00:48:59,980 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9373601789709173 [2022-01-19 00:48:59,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1676 transitions. [2022-01-19 00:48:59,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1676 transitions. [2022-01-19 00:48:59,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:59,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1676 transitions. [2022-01-19 00:48:59,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.6666666666666) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,984 INFO L186 Difference]: Start difference. First operand has 584 places, 599 transitions, 1537 flow. Second operand 3 states and 1676 transitions. [2022-01-19 00:48:59,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 606 transitions, 1609 flow [2022-01-19 00:48:59,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 606 transitions, 1600 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:48:59,997 INFO L242 Difference]: Finished difference. Result has 585 places, 600 transitions, 1546 flow [2022-01-19 00:48:59,997 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1546, PETRI_PLACES=585, PETRI_TRANSITIONS=600} [2022-01-19 00:48:59,998 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 58 predicate places. [2022-01-19 00:48:59,998 INFO L470 AbstractCegarLoop]: Abstraction has has 585 places, 600 transitions, 1546 flow [2022-01-19 00:48:59,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:59,998 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:59,998 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:48:59,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:48:59,999 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:48:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:59,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1542592377, now seen corresponding path program 1 times [2022-01-19 00:48:59,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:59,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45412140] [2022-01-19 00:48:59,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:59,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:00,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:00,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45412140] [2022-01-19 00:49:00,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45412140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:00,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:00,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:00,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352426563] [2022-01-19 00:49:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:00,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:00,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:00,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:00,086 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 596 [2022-01-19 00:49:00,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 600 transitions, 1546 flow. Second operand has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:00,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:00,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 596 [2022-01-19 00:49:00,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:00,586 INFO L129 PetriNetUnfolder]: 179/2575 cut-off events. [2022-01-19 00:49:00,586 INFO L130 PetriNetUnfolder]: For 125/167 co-relation queries the response was YES. [2022-01-19 00:49:00,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2575 events. 179/2575 cut-off events. For 125/167 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17246 event pairs, 12 based on Foata normal form. 2/2357 useless extension candidates. Maximal degree in co-relation 3172. Up to 58 conditions per place. [2022-01-19 00:49:00,627 INFO L132 encePairwiseOnDemand]: 591/596 looper letters, 25 selfloop transitions, 4 changer transitions 0/608 dead transitions. [2022-01-19 00:49:00,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 608 transitions, 1623 flow [2022-01-19 00:49:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1677 transitions. [2022-01-19 00:49:00,630 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379194630872483 [2022-01-19 00:49:00,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1677 transitions. [2022-01-19 00:49:00,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1677 transitions. [2022-01-19 00:49:00,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:00,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1677 transitions. [2022-01-19 00:49:00,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:00,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:00,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:00,635 INFO L186 Difference]: Start difference. First operand has 585 places, 600 transitions, 1546 flow. Second operand 3 states and 1677 transitions. [2022-01-19 00:49:00,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 608 transitions, 1623 flow [2022-01-19 00:49:00,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 608 transitions, 1619 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:00,648 INFO L242 Difference]: Finished difference. Result has 587 places, 601 transitions, 1560 flow [2022-01-19 00:49:00,649 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1560, PETRI_PLACES=587, PETRI_TRANSITIONS=601} [2022-01-19 00:49:00,649 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 60 predicate places. [2022-01-19 00:49:00,649 INFO L470 AbstractCegarLoop]: Abstraction has has 587 places, 601 transitions, 1560 flow [2022-01-19 00:49:00,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:00,650 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:00,650 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:00,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:49:00,650 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1049860450, now seen corresponding path program 1 times [2022-01-19 00:49:00,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:00,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853491641] [2022-01-19 00:49:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:00,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:00,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:00,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853491641] [2022-01-19 00:49:00,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853491641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:00,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:00,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:00,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799557747] [2022-01-19 00:49:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:00,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:00,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:00,722 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 00:49:00,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 601 transitions, 1560 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:00,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:00,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 00:49:00,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:01,259 INFO L129 PetriNetUnfolder]: 225/3066 cut-off events. [2022-01-19 00:49:01,259 INFO L130 PetriNetUnfolder]: For 240/296 co-relation queries the response was YES. [2022-01-19 00:49:01,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 3066 events. 225/3066 cut-off events. For 240/296 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 22334 event pairs, 31 based on Foata normal form. 4/2849 useless extension candidates. Maximal degree in co-relation 3972. Up to 95 conditions per place. [2022-01-19 00:49:01,292 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 26 selfloop transitions, 5 changer transitions 0/612 dead transitions. [2022-01-19 00:49:01,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 612 transitions, 1650 flow [2022-01-19 00:49:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1683 transitions. [2022-01-19 00:49:01,296 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412751677852349 [2022-01-19 00:49:01,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1683 transitions. [2022-01-19 00:49:01,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1683 transitions. [2022-01-19 00:49:01,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:01,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1683 transitions. [2022-01-19 00:49:01,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,302 INFO L186 Difference]: Start difference. First operand has 587 places, 601 transitions, 1560 flow. Second operand 3 states and 1683 transitions. [2022-01-19 00:49:01,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 612 transitions, 1650 flow [2022-01-19 00:49:01,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 612 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:01,318 INFO L242 Difference]: Finished difference. Result has 590 places, 604 transitions, 1595 flow [2022-01-19 00:49:01,319 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1595, PETRI_PLACES=590, PETRI_TRANSITIONS=604} [2022-01-19 00:49:01,320 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 63 predicate places. [2022-01-19 00:49:01,320 INFO L470 AbstractCegarLoop]: Abstraction has has 590 places, 604 transitions, 1595 flow [2022-01-19 00:49:01,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,320 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:01,321 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:01,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:49:01,321 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1896665874, now seen corresponding path program 2 times [2022-01-19 00:49:01,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:01,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035477475] [2022-01-19 00:49:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:01,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:01,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:01,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035477475] [2022-01-19 00:49:01,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035477475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:01,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:01,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:01,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551640789] [2022-01-19 00:49:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:01,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:01,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:01,375 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 00:49:01,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 604 transitions, 1595 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:01,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 00:49:01,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:01,831 INFO L129 PetriNetUnfolder]: 221/2931 cut-off events. [2022-01-19 00:49:01,831 INFO L130 PetriNetUnfolder]: For 311/371 co-relation queries the response was YES. [2022-01-19 00:49:01,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 2931 events. 221/2931 cut-off events. For 311/371 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 20852 event pairs, 40 based on Foata normal form. 3/2717 useless extension candidates. Maximal degree in co-relation 3855. Up to 128 conditions per place. [2022-01-19 00:49:01,906 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 26 selfloop transitions, 2 changer transitions 3/612 dead transitions. [2022-01-19 00:49:01,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 612 transitions, 1676 flow [2022-01-19 00:49:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1680 transitions. [2022-01-19 00:49:01,911 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9395973154362416 [2022-01-19 00:49:01,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1680 transitions. [2022-01-19 00:49:01,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1680 transitions. [2022-01-19 00:49:01,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:01,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1680 transitions. [2022-01-19 00:49:01,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,915 INFO L186 Difference]: Start difference. First operand has 590 places, 604 transitions, 1595 flow. Second operand 3 states and 1680 transitions. [2022-01-19 00:49:01,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 612 transitions, 1676 flow [2022-01-19 00:49:01,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 612 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:01,928 INFO L242 Difference]: Finished difference. Result has 591 places, 604 transitions, 1595 flow [2022-01-19 00:49:01,928 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1595, PETRI_PLACES=591, PETRI_TRANSITIONS=604} [2022-01-19 00:49:01,929 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 64 predicate places. [2022-01-19 00:49:01,929 INFO L470 AbstractCegarLoop]: Abstraction has has 591 places, 604 transitions, 1595 flow [2022-01-19 00:49:01,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,929 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:01,930 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:01,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:49:01,930 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash 428392958, now seen corresponding path program 1 times [2022-01-19 00:49:01,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:01,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396603788] [2022-01-19 00:49:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:01,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:01,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:01,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396603788] [2022-01-19 00:49:01,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396603788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:01,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:01,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:01,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341221990] [2022-01-19 00:49:01,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:01,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:01,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:01,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 00:49:01,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 604 transitions, 1595 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:01,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:01,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 00:49:01,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:02,487 INFO L129 PetriNetUnfolder]: 236/3053 cut-off events. [2022-01-19 00:49:02,487 INFO L130 PetriNetUnfolder]: For 365/427 co-relation queries the response was YES. [2022-01-19 00:49:02,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 3053 events. 236/3053 cut-off events. For 365/427 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22043 event pairs, 39 based on Foata normal form. 5/2822 useless extension candidates. Maximal degree in co-relation 3928. Up to 116 conditions per place. [2022-01-19 00:49:02,525 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 26 selfloop transitions, 3 changer transitions 3/613 dead transitions. [2022-01-19 00:49:02,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 613 transitions, 1684 flow [2022-01-19 00:49:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1681 transitions. [2022-01-19 00:49:02,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9401565995525727 [2022-01-19 00:49:02,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1681 transitions. [2022-01-19 00:49:02,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1681 transitions. [2022-01-19 00:49:02,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:02,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1681 transitions. [2022-01-19 00:49:02,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:02,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:02,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:02,532 INFO L186 Difference]: Start difference. First operand has 591 places, 604 transitions, 1595 flow. Second operand 3 states and 1681 transitions. [2022-01-19 00:49:02,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 613 transitions, 1684 flow [2022-01-19 00:49:02,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 613 transitions, 1682 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:02,546 INFO L242 Difference]: Finished difference. Result has 593 places, 604 transitions, 1606 flow [2022-01-19 00:49:02,546 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=593, PETRI_TRANSITIONS=604} [2022-01-19 00:49:02,547 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 66 predicate places. [2022-01-19 00:49:02,547 INFO L470 AbstractCegarLoop]: Abstraction has has 593 places, 604 transitions, 1606 flow [2022-01-19 00:49:02,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:02,547 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:02,548 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:02,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:49:02,548 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2085797344, now seen corresponding path program 2 times [2022-01-19 00:49:02,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:02,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922874888] [2022-01-19 00:49:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:02,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:02,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:02,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922874888] [2022-01-19 00:49:02,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922874888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:02,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:02,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:02,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784652898] [2022-01-19 00:49:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:02,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:02,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:02,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 00:49:02,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 604 transitions, 1606 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:02,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:02,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 00:49:02,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:03,123 INFO L129 PetriNetUnfolder]: 215/2844 cut-off events. [2022-01-19 00:49:03,123 INFO L130 PetriNetUnfolder]: For 428/494 co-relation queries the response was YES. [2022-01-19 00:49:03,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3790 conditions, 2844 events. 215/2844 cut-off events. For 428/494 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19686 event pairs, 26 based on Foata normal form. 4/2642 useless extension candidates. Maximal degree in co-relation 3753. Up to 74 conditions per place. [2022-01-19 00:49:03,155 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 27 selfloop transitions, 5 changer transitions 3/616 dead transitions. [2022-01-19 00:49:03,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 616 transitions, 1720 flow [2022-01-19 00:49:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1683 transitions. [2022-01-19 00:49:03,158 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412751677852349 [2022-01-19 00:49:03,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1683 transitions. [2022-01-19 00:49:03,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1683 transitions. [2022-01-19 00:49:03,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:03,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1683 transitions. [2022-01-19 00:49:03,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:03,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:03,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:03,163 INFO L186 Difference]: Start difference. First operand has 593 places, 604 transitions, 1606 flow. Second operand 3 states and 1683 transitions. [2022-01-19 00:49:03,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 616 transitions, 1720 flow [2022-01-19 00:49:03,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1717 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:03,178 INFO L242 Difference]: Finished difference. Result has 596 places, 605 transitions, 1628 flow [2022-01-19 00:49:03,179 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1628, PETRI_PLACES=596, PETRI_TRANSITIONS=605} [2022-01-19 00:49:03,179 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 69 predicate places. [2022-01-19 00:49:03,179 INFO L470 AbstractCegarLoop]: Abstraction has has 596 places, 605 transitions, 1628 flow [2022-01-19 00:49:03,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:03,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:03,180 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:03,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:49:03,180 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash 371722502, now seen corresponding path program 1 times [2022-01-19 00:49:03,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:03,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048455098] [2022-01-19 00:49:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:03,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:03,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048455098] [2022-01-19 00:49:03,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048455098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:03,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:03,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:03,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697317915] [2022-01-19 00:49:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:03,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:03,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:03,259 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:03,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 605 transitions, 1628 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:03,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:03,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:03,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:04,281 INFO L129 PetriNetUnfolder]: 1062/6556 cut-off events. [2022-01-19 00:49:04,281 INFO L130 PetriNetUnfolder]: For 2187/2189 co-relation queries the response was YES. [2022-01-19 00:49:04,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9902 conditions, 6556 events. 1062/6556 cut-off events. For 2187/2189 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 63139 event pairs, 409 based on Foata normal form. 1/5865 useless extension candidates. Maximal degree in co-relation 9864. Up to 1002 conditions per place. [2022-01-19 00:49:04,329 INFO L132 encePairwiseOnDemand]: 574/596 looper letters, 71 selfloop transitions, 21 changer transitions 29/666 dead transitions. [2022-01-19 00:49:04,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 666 transitions, 2081 flow [2022-01-19 00:49:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3713 transitions. [2022-01-19 00:49:04,336 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8899808245445829 [2022-01-19 00:49:04,336 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3713 transitions. [2022-01-19 00:49:04,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3713 transitions. [2022-01-19 00:49:04,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:04,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3713 transitions. [2022-01-19 00:49:04,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 530.4285714285714) internal successors, (3713), 7 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:04,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:04,344 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:04,344 INFO L186 Difference]: Start difference. First operand has 596 places, 605 transitions, 1628 flow. Second operand 7 states and 3713 transitions. [2022-01-19 00:49:04,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 666 transitions, 2081 flow [2022-01-19 00:49:04,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 666 transitions, 2047 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:04,366 INFO L242 Difference]: Finished difference. Result has 606 places, 615 transitions, 1753 flow [2022-01-19 00:49:04,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1753, PETRI_PLACES=606, PETRI_TRANSITIONS=615} [2022-01-19 00:49:04,367 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 79 predicate places. [2022-01-19 00:49:04,368 INFO L470 AbstractCegarLoop]: Abstraction has has 606 places, 615 transitions, 1753 flow [2022-01-19 00:49:04,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:04,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:04,368 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:04,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:49:04,369 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash -487313754, now seen corresponding path program 2 times [2022-01-19 00:49:04,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:04,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469951089] [2022-01-19 00:49:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:04,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:04,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:04,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469951089] [2022-01-19 00:49:04,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469951089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:04,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:04,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:04,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802972233] [2022-01-19 00:49:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:04,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:04,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:04,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:04,482 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:04,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 615 transitions, 1753 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:04,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:04,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:04,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:05,413 INFO L129 PetriNetUnfolder]: 965/5840 cut-off events. [2022-01-19 00:49:05,413 INFO L130 PetriNetUnfolder]: For 2973/2985 co-relation queries the response was YES. [2022-01-19 00:49:05,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9292 conditions, 5840 events. 965/5840 cut-off events. For 2973/2985 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 54895 event pairs, 348 based on Foata normal form. 42/5414 useless extension candidates. Maximal degree in co-relation 9249. Up to 1071 conditions per place. [2022-01-19 00:49:05,460 INFO L132 encePairwiseOnDemand]: 585/596 looper letters, 82 selfloop transitions, 12 changer transitions 15/654 dead transitions. [2022-01-19 00:49:05,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 654 transitions, 2159 flow [2022-01-19 00:49:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:49:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:49:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3179 transitions. [2022-01-19 00:49:05,465 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8889821029082774 [2022-01-19 00:49:05,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3179 transitions. [2022-01-19 00:49:05,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3179 transitions. [2022-01-19 00:49:05,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:05,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3179 transitions. [2022-01-19 00:49:05,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 529.8333333333334) internal successors, (3179), 6 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,480 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,481 INFO L186 Difference]: Start difference. First operand has 606 places, 615 transitions, 1753 flow. Second operand 6 states and 3179 transitions. [2022-01-19 00:49:05,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 654 transitions, 2159 flow [2022-01-19 00:49:05,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 654 transitions, 2155 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:05,505 INFO L242 Difference]: Finished difference. Result has 613 places, 621 transitions, 1855 flow [2022-01-19 00:49:05,506 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1855, PETRI_PLACES=613, PETRI_TRANSITIONS=621} [2022-01-19 00:49:05,506 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 86 predicate places. [2022-01-19 00:49:05,506 INFO L470 AbstractCegarLoop]: Abstraction has has 613 places, 621 transitions, 1855 flow [2022-01-19 00:49:05,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:05,507 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:05,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:49:05,507 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 742915764, now seen corresponding path program 3 times [2022-01-19 00:49:05,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942344886] [2022-01-19 00:49:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:05,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:05,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:05,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942344886] [2022-01-19 00:49:05,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942344886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:05,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:05,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:05,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801671001] [2022-01-19 00:49:05,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:05,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:05,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:05,601 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 00:49:05,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 621 transitions, 1855 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:05,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 00:49:05,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:06,697 INFO L129 PetriNetUnfolder]: 978/6239 cut-off events. [2022-01-19 00:49:06,697 INFO L130 PetriNetUnfolder]: For 2859/2891 co-relation queries the response was YES. [2022-01-19 00:49:06,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10038 conditions, 6239 events. 978/6239 cut-off events. For 2859/2891 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 59455 event pairs, 396 based on Foata normal form. 20/5759 useless extension candidates. Maximal degree in co-relation 9992. Up to 772 conditions per place. [2022-01-19 00:49:06,754 INFO L132 encePairwiseOnDemand]: 581/596 looper letters, 82 selfloop transitions, 15 changer transitions 35/675 dead transitions. [2022-01-19 00:49:06,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 675 transitions, 2349 flow [2022-01-19 00:49:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3693 transitions. [2022-01-19 00:49:06,758 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851869606903164 [2022-01-19 00:49:06,758 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3693 transitions. [2022-01-19 00:49:06,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3693 transitions. [2022-01-19 00:49:06,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:06,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3693 transitions. [2022-01-19 00:49:06,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 527.5714285714286) internal successors, (3693), 7 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:06,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:06,766 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:06,766 INFO L186 Difference]: Start difference. First operand has 613 places, 621 transitions, 1855 flow. Second operand 7 states and 3693 transitions. [2022-01-19 00:49:06,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 675 transitions, 2349 flow [2022-01-19 00:49:06,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 675 transitions, 2331 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-01-19 00:49:06,796 INFO L242 Difference]: Finished difference. Result has 622 places, 616 transitions, 1843 flow [2022-01-19 00:49:06,797 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1843, PETRI_PLACES=622, PETRI_TRANSITIONS=616} [2022-01-19 00:49:06,797 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 00:49:06,797 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 616 transitions, 1843 flow [2022-01-19 00:49:06,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:06,798 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:06,798 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:06,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:49:06,798 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1823887304, now seen corresponding path program 4 times [2022-01-19 00:49:06,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:06,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061207567] [2022-01-19 00:49:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:06,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:06,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:06,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061207567] [2022-01-19 00:49:06,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061207567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:06,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:06,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:06,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479536871] [2022-01-19 00:49:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:06,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:06,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:06,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:06,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:06,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 616 transitions, 1843 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:06,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:06,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:06,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:07,909 INFO L129 PetriNetUnfolder]: 891/5807 cut-off events. [2022-01-19 00:49:07,909 INFO L130 PetriNetUnfolder]: For 3132/3150 co-relation queries the response was YES. [2022-01-19 00:49:07,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 5807 events. 891/5807 cut-off events. For 3132/3150 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 53568 event pairs, 203 based on Foata normal form. 14/5357 useless extension candidates. Maximal degree in co-relation 9203. Up to 794 conditions per place. [2022-01-19 00:49:07,960 INFO L132 encePairwiseOnDemand]: 567/596 looper letters, 75 selfloop transitions, 34 changer transitions 16/667 dead transitions. [2022-01-19 00:49:07,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 667 transitions, 2267 flow [2022-01-19 00:49:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3711 transitions. [2022-01-19 00:49:07,962 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8895014381591563 [2022-01-19 00:49:07,962 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3711 transitions. [2022-01-19 00:49:07,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3711 transitions. [2022-01-19 00:49:07,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:07,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3711 transitions. [2022-01-19 00:49:07,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 530.1428571428571) internal successors, (3711), 7 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:07,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:07,970 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:07,970 INFO L186 Difference]: Start difference. First operand has 622 places, 616 transitions, 1843 flow. Second operand 7 states and 3711 transitions. [2022-01-19 00:49:07,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 667 transitions, 2267 flow [2022-01-19 00:49:07,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 667 transitions, 2229 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-01-19 00:49:08,000 INFO L242 Difference]: Finished difference. Result has 622 places, 625 transitions, 1938 flow [2022-01-19 00:49:08,001 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1938, PETRI_PLACES=622, PETRI_TRANSITIONS=625} [2022-01-19 00:49:08,002 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 00:49:08,002 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 625 transitions, 1938 flow [2022-01-19 00:49:08,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:08,002 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:08,002 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:08,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:49:08,003 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1135082975, now seen corresponding path program 1 times [2022-01-19 00:49:08,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:08,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51302050] [2022-01-19 00:49:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:08,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:08,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51302050] [2022-01-19 00:49:08,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51302050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:08,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:08,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:08,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874539935] [2022-01-19 00:49:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:08,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:08,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:08,109 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 00:49:08,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 625 transitions, 1938 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:08,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:08,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 00:49:08,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:08,876 INFO L129 PetriNetUnfolder]: 619/4670 cut-off events. [2022-01-19 00:49:08,876 INFO L130 PetriNetUnfolder]: For 7560/8273 co-relation queries the response was YES. [2022-01-19 00:49:08,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 4670 events. 619/4670 cut-off events. For 7560/8273 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39167 event pairs, 79 based on Foata normal form. 155/4525 useless extension candidates. Maximal degree in co-relation 7703. Up to 565 conditions per place. [2022-01-19 00:49:08,921 INFO L132 encePairwiseOnDemand]: 588/596 looper letters, 82 selfloop transitions, 6 changer transitions 7/655 dead transitions. [2022-01-19 00:49:08,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 655 transitions, 2354 flow [2022-01-19 00:49:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:49:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:49:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3159 transitions. [2022-01-19 00:49:08,923 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8833892617449665 [2022-01-19 00:49:08,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3159 transitions. [2022-01-19 00:49:08,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3159 transitions. [2022-01-19 00:49:08,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:08,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3159 transitions. [2022-01-19 00:49:08,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 526.5) internal successors, (3159), 6 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:08,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:08,931 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:08,931 INFO L186 Difference]: Start difference. First operand has 622 places, 625 transitions, 1938 flow. Second operand 6 states and 3159 transitions. [2022-01-19 00:49:08,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 655 transitions, 2354 flow [2022-01-19 00:49:08,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 655 transitions, 2291 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-01-19 00:49:08,956 INFO L242 Difference]: Finished difference. Result has 615 places, 625 transitions, 1911 flow [2022-01-19 00:49:08,957 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1911, PETRI_PLACES=615, PETRI_TRANSITIONS=625} [2022-01-19 00:49:08,958 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 88 predicate places. [2022-01-19 00:49:08,958 INFO L470 AbstractCegarLoop]: Abstraction has has 615 places, 625 transitions, 1911 flow [2022-01-19 00:49:08,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:08,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:08,958 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:08,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:49:08,959 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1888026411, now seen corresponding path program 2 times [2022-01-19 00:49:08,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581282655] [2022-01-19 00:49:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:08,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:09,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:09,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581282655] [2022-01-19 00:49:09,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581282655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:09,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:09,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:09,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737588964] [2022-01-19 00:49:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:09,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:09,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:09,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:09,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 00:49:09,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 625 transitions, 1911 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:09,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:09,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 00:49:09,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:09,898 INFO L129 PetriNetUnfolder]: 617/5089 cut-off events. [2022-01-19 00:49:09,898 INFO L130 PetriNetUnfolder]: For 3158/3871 co-relation queries the response was YES. [2022-01-19 00:49:09,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8401 conditions, 5089 events. 617/5089 cut-off events. For 3158/3871 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 44863 event pairs, 259 based on Foata normal form. 22/4834 useless extension candidates. Maximal degree in co-relation 8358. Up to 597 conditions per place. [2022-01-19 00:49:09,934 INFO L132 encePairwiseOnDemand]: 582/596 looper letters, 73 selfloop transitions, 15 changer transitions 22/670 dead transitions. [2022-01-19 00:49:09,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 670 transitions, 2285 flow [2022-01-19 00:49:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3685 transitions. [2022-01-19 00:49:09,936 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832694151486098 [2022-01-19 00:49:09,937 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3685 transitions. [2022-01-19 00:49:09,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3685 transitions. [2022-01-19 00:49:09,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:09,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3685 transitions. [2022-01-19 00:49:09,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 526.4285714285714) internal successors, (3685), 7 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:09,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:09,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:09,944 INFO L186 Difference]: Start difference. First operand has 615 places, 625 transitions, 1911 flow. Second operand 7 states and 3685 transitions. [2022-01-19 00:49:09,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 670 transitions, 2285 flow [2022-01-19 00:49:09,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 670 transitions, 2269 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 00:49:09,970 INFO L242 Difference]: Finished difference. Result has 621 places, 625 transitions, 1946 flow [2022-01-19 00:49:09,971 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1946, PETRI_PLACES=621, PETRI_TRANSITIONS=625} [2022-01-19 00:49:09,971 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 94 predicate places. [2022-01-19 00:49:09,971 INFO L470 AbstractCegarLoop]: Abstraction has has 621 places, 625 transitions, 1946 flow [2022-01-19 00:49:09,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:09,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:09,972 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:09,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:49:09,972 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1195017717, now seen corresponding path program 3 times [2022-01-19 00:49:09,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:09,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88003429] [2022-01-19 00:49:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:09,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:10,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88003429] [2022-01-19 00:49:10,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88003429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:10,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:10,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:10,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311478620] [2022-01-19 00:49:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:10,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:10,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:10,070 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:10,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 625 transitions, 1946 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:10,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:10,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:10,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:10,929 INFO L129 PetriNetUnfolder]: 611/4816 cut-off events. [2022-01-19 00:49:10,929 INFO L130 PetriNetUnfolder]: For 3622/4354 co-relation queries the response was YES. [2022-01-19 00:49:10,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8020 conditions, 4816 events. 611/4816 cut-off events. For 3622/4354 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 41166 event pairs, 234 based on Foata normal form. 84/4691 useless extension candidates. Maximal degree in co-relation 7974. Up to 655 conditions per place. [2022-01-19 00:49:10,967 INFO L132 encePairwiseOnDemand]: 573/596 looper letters, 71 selfloop transitions, 18 changer transitions 17/668 dead transitions. [2022-01-19 00:49:10,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 668 transitions, 2406 flow [2022-01-19 00:49:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3695 transitions. [2022-01-19 00:49:10,969 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8856663470757431 [2022-01-19 00:49:10,969 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3695 transitions. [2022-01-19 00:49:10,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3695 transitions. [2022-01-19 00:49:10,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:10,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3695 transitions. [2022-01-19 00:49:10,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 527.8571428571429) internal successors, (3695), 7 states have internal predecessors, (3695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:10,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:10,975 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:10,975 INFO L186 Difference]: Start difference. First operand has 621 places, 625 transitions, 1946 flow. Second operand 7 states and 3695 transitions. [2022-01-19 00:49:10,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 668 transitions, 2406 flow [2022-01-19 00:49:10,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 668 transitions, 2400 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:10,999 INFO L242 Difference]: Finished difference. Result has 627 places, 632 transitions, 2060 flow [2022-01-19 00:49:11,000 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2060, PETRI_PLACES=627, PETRI_TRANSITIONS=632} [2022-01-19 00:49:11,000 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 100 predicate places. [2022-01-19 00:49:11,000 INFO L470 AbstractCegarLoop]: Abstraction has has 627 places, 632 transitions, 2060 flow [2022-01-19 00:49:11,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:11,001 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:11,001 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:11,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:49:11,001 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash -266538759, now seen corresponding path program 4 times [2022-01-19 00:49:11,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:11,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598047006] [2022-01-19 00:49:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:11,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:11,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:11,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598047006] [2022-01-19 00:49:11,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598047006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:11,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:11,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:11,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391649153] [2022-01-19 00:49:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:11,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:11,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:11,076 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 00:49:11,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 632 transitions, 2060 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:11,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:11,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 00:49:11,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:12,006 INFO L129 PetriNetUnfolder]: 641/5341 cut-off events. [2022-01-19 00:49:12,007 INFO L130 PetriNetUnfolder]: For 3913/4253 co-relation queries the response was YES. [2022-01-19 00:49:12,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9040 conditions, 5341 events. 641/5341 cut-off events. For 3913/4253 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 47623 event pairs, 218 based on Foata normal form. 25/5105 useless extension candidates. Maximal degree in co-relation 8991. Up to 645 conditions per place. [2022-01-19 00:49:12,044 INFO L132 encePairwiseOnDemand]: 581/596 looper letters, 66 selfloop transitions, 14 changer transitions 18/655 dead transitions. [2022-01-19 00:49:12,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 655 transitions, 2396 flow [2022-01-19 00:49:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3665 transitions. [2022-01-19 00:49:12,047 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784755512943433 [2022-01-19 00:49:12,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3665 transitions. [2022-01-19 00:49:12,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3665 transitions. [2022-01-19 00:49:12,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:12,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3665 transitions. [2022-01-19 00:49:12,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 523.5714285714286) internal successors, (3665), 7 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:12,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:12,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:12,053 INFO L186 Difference]: Start difference. First operand has 627 places, 632 transitions, 2060 flow. Second operand 7 states and 3665 transitions. [2022-01-19 00:49:12,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 655 transitions, 2396 flow [2022-01-19 00:49:12,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 655 transitions, 2372 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-01-19 00:49:12,083 INFO L242 Difference]: Finished difference. Result has 632 places, 627 transitions, 2017 flow [2022-01-19 00:49:12,084 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2017, PETRI_PLACES=632, PETRI_TRANSITIONS=627} [2022-01-19 00:49:12,084 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 105 predicate places. [2022-01-19 00:49:12,085 INFO L470 AbstractCegarLoop]: Abstraction has has 632 places, 627 transitions, 2017 flow [2022-01-19 00:49:12,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:12,085 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:12,085 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:12,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:49:12,086 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1985383172, now seen corresponding path program 1 times [2022-01-19 00:49:12,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:12,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755814396] [2022-01-19 00:49:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:12,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:12,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:12,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755814396] [2022-01-19 00:49:12,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755814396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:12,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:12,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:12,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374049742] [2022-01-19 00:49:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:12,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:12,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:12,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:12,165 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:12,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 627 transitions, 2017 flow. Second operand has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:12,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:12,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:12,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:13,048 INFO L129 PetriNetUnfolder]: 788/4876 cut-off events. [2022-01-19 00:49:13,048 INFO L130 PetriNetUnfolder]: For 3809/3810 co-relation queries the response was YES. [2022-01-19 00:49:13,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8235 conditions, 4876 events. 788/4876 cut-off events. For 3809/3810 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 43528 event pairs, 87 based on Foata normal form. 33/4521 useless extension candidates. Maximal degree in co-relation 8186. Up to 728 conditions per place. [2022-01-19 00:49:13,104 INFO L132 encePairwiseOnDemand]: 586/596 looper letters, 72 selfloop transitions, 12 changer transitions 6/635 dead transitions. [2022-01-19 00:49:13,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 2194 flow [2022-01-19 00:49:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:49:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:49:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3161 transitions. [2022-01-19 00:49:13,106 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839485458612976 [2022-01-19 00:49:13,106 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3161 transitions. [2022-01-19 00:49:13,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3161 transitions. [2022-01-19 00:49:13,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:13,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3161 transitions. [2022-01-19 00:49:13,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 526.8333333333334) internal successors, (3161), 6 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:13,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:13,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:13,111 INFO L186 Difference]: Start difference. First operand has 632 places, 627 transitions, 2017 flow. Second operand 6 states and 3161 transitions. [2022-01-19 00:49:13,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 2194 flow [2022-01-19 00:49:13,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 635 transitions, 2070 flow, removed 25 selfloop flow, removed 12 redundant places. [2022-01-19 00:49:13,135 INFO L242 Difference]: Finished difference. Result has 620 places, 612 transitions, 1819 flow [2022-01-19 00:49:13,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1819, PETRI_PLACES=620, PETRI_TRANSITIONS=612} [2022-01-19 00:49:13,136 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 93 predicate places. [2022-01-19 00:49:13,136 INFO L470 AbstractCegarLoop]: Abstraction has has 620 places, 612 transitions, 1819 flow [2022-01-19 00:49:13,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:13,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:13,137 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:13,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:49:13,137 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1106359420, now seen corresponding path program 2 times [2022-01-19 00:49:13,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:13,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095540381] [2022-01-19 00:49:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:13,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:13,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:13,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095540381] [2022-01-19 00:49:13,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095540381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:13,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:13,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:13,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6812395] [2022-01-19 00:49:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:13,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:13,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:13,215 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:13,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 612 transitions, 1819 flow. Second operand has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:13,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:13,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:13,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:14,057 INFO L129 PetriNetUnfolder]: 823/5387 cut-off events. [2022-01-19 00:49:14,058 INFO L130 PetriNetUnfolder]: For 1445/1445 co-relation queries the response was YES. [2022-01-19 00:49:14,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8260 conditions, 5387 events. 823/5387 cut-off events. For 1445/1445 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 48586 event pairs, 207 based on Foata normal form. 2/4972 useless extension candidates. Maximal degree in co-relation 8217. Up to 780 conditions per place. [2022-01-19 00:49:14,101 INFO L132 encePairwiseOnDemand]: 577/596 looper letters, 65 selfloop transitions, 19 changer transitions 11/640 dead transitions. [2022-01-19 00:49:14,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 640 transitions, 2125 flow [2022-01-19 00:49:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3684 transitions. [2022-01-19 00:49:14,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8830297219558965 [2022-01-19 00:49:14,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3684 transitions. [2022-01-19 00:49:14,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3684 transitions. [2022-01-19 00:49:14,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:14,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3684 transitions. [2022-01-19 00:49:14,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 526.2857142857143) internal successors, (3684), 7 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:14,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:14,108 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:14,108 INFO L186 Difference]: Start difference. First operand has 620 places, 612 transitions, 1819 flow. Second operand 7 states and 3684 transitions. [2022-01-19 00:49:14,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 640 transitions, 2125 flow [2022-01-19 00:49:14,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 640 transitions, 2101 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 00:49:14,126 INFO L242 Difference]: Finished difference. Result has 622 places, 611 transitions, 1824 flow [2022-01-19 00:49:14,127 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1824, PETRI_PLACES=622, PETRI_TRANSITIONS=611} [2022-01-19 00:49:14,127 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 00:49:14,127 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 611 transitions, 1824 flow [2022-01-19 00:49:14,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:14,128 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:14,128 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:14,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 00:49:14,128 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2127604216, now seen corresponding path program 3 times [2022-01-19 00:49:14,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:14,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079571652] [2022-01-19 00:49:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:14,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:14,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:14,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079571652] [2022-01-19 00:49:14,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079571652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:14,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:14,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:14,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583538971] [2022-01-19 00:49:14,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:14,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:14,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:14,195 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 00:49:14,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 611 transitions, 1824 flow. Second operand has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:14,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:14,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 00:49:14,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:15,028 INFO L129 PetriNetUnfolder]: 748/4823 cut-off events. [2022-01-19 00:49:15,029 INFO L130 PetriNetUnfolder]: For 1631/1631 co-relation queries the response was YES. [2022-01-19 00:49:15,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7617 conditions, 4823 events. 748/4823 cut-off events. For 1631/1631 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 41905 event pairs, 221 based on Foata normal form. 2/4437 useless extension candidates. Maximal degree in co-relation 7574. Up to 717 conditions per place. [2022-01-19 00:49:15,055 INFO L132 encePairwiseOnDemand]: 579/596 looper letters, 55 selfloop transitions, 14 changer transitions 21/630 dead transitions. [2022-01-19 00:49:15,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 630 transitions, 2068 flow [2022-01-19 00:49:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3675 transitions. [2022-01-19 00:49:15,058 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8808724832214765 [2022-01-19 00:49:15,058 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3675 transitions. [2022-01-19 00:49:15,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3675 transitions. [2022-01-19 00:49:15,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:15,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3675 transitions. [2022-01-19 00:49:15,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 525.0) internal successors, (3675), 7 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,064 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,064 INFO L186 Difference]: Start difference. First operand has 622 places, 611 transitions, 1824 flow. Second operand 7 states and 3675 transitions. [2022-01-19 00:49:15,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 630 transitions, 2068 flow [2022-01-19 00:49:15,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 630 transitions, 2039 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-01-19 00:49:15,082 INFO L242 Difference]: Finished difference. Result has 622 places, 601 transitions, 1754 flow [2022-01-19 00:49:15,083 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1754, PETRI_PLACES=622, PETRI_TRANSITIONS=601} [2022-01-19 00:49:15,083 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 00:49:15,083 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 601 transitions, 1754 flow [2022-01-19 00:49:15,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,084 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:15,084 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:15,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 00:49:15,084 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 134093937, now seen corresponding path program 1 times [2022-01-19 00:49:15,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:15,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715533517] [2022-01-19 00:49:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:15,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:15,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:15,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715533517] [2022-01-19 00:49:15,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715533517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:15,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:15,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:15,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749061130] [2022-01-19 00:49:15,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:15,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:15,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:15,169 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 00:49:15,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 601 transitions, 1754 flow. Second operand has 5 states, 5 states have (on average 517.4) internal successors, (2587), 5 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:15,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 00:49:15,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:15,725 INFO L129 PetriNetUnfolder]: 499/3326 cut-off events. [2022-01-19 00:49:15,725 INFO L130 PetriNetUnfolder]: For 1856/1969 co-relation queries the response was YES. [2022-01-19 00:49:15,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5677 conditions, 3326 events. 499/3326 cut-off events. For 1856/1969 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 24933 event pairs, 229 based on Foata normal form. 7/3180 useless extension candidates. Maximal degree in co-relation 5637. Up to 531 conditions per place. [2022-01-19 00:49:15,757 INFO L132 encePairwiseOnDemand]: 580/596 looper letters, 67 selfloop transitions, 14 changer transitions 14/626 dead transitions. [2022-01-19 00:49:15,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 626 transitions, 2063 flow [2022-01-19 00:49:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3669 transitions. [2022-01-19 00:49:15,759 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8794343240651965 [2022-01-19 00:49:15,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3669 transitions. [2022-01-19 00:49:15,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3669 transitions. [2022-01-19 00:49:15,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:15,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3669 transitions. [2022-01-19 00:49:15,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 524.1428571428571) internal successors, (3669), 7 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,764 INFO L186 Difference]: Start difference. First operand has 622 places, 601 transitions, 1754 flow. Second operand 7 states and 3669 transitions. [2022-01-19 00:49:15,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 626 transitions, 2063 flow [2022-01-19 00:49:15,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 626 transitions, 1950 flow, removed 14 selfloop flow, removed 16 redundant places. [2022-01-19 00:49:15,782 INFO L242 Difference]: Finished difference. Result has 604 places, 593 transitions, 1656 flow [2022-01-19 00:49:15,782 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1656, PETRI_PLACES=604, PETRI_TRANSITIONS=593} [2022-01-19 00:49:15,783 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 77 predicate places. [2022-01-19 00:49:15,783 INFO L470 AbstractCegarLoop]: Abstraction has has 604 places, 593 transitions, 1656 flow [2022-01-19 00:49:15,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.4) internal successors, (2587), 5 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:15,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:15,784 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:15,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 00:49:15,784 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -70398850, now seen corresponding path program 1 times [2022-01-19 00:49:15,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787656716] [2022-01-19 00:49:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:15,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:15,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:15,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787656716] [2022-01-19 00:49:15,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787656716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:15,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:15,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:15,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633392291] [2022-01-19 00:49:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:15,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:15,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:15,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:15,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:15,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:15,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 593 transitions, 1656 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:16,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:16,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:16,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:20,966 INFO L129 PetriNetUnfolder]: 3263/15475 cut-off events. [2022-01-19 00:49:20,966 INFO L130 PetriNetUnfolder]: For 562/563 co-relation queries the response was YES. [2022-01-19 00:49:21,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23493 conditions, 15475 events. 3263/15475 cut-off events. For 562/563 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 165344 event pairs, 1461 based on Foata normal form. 0/14358 useless extension candidates. Maximal degree in co-relation 23463. Up to 3100 conditions per place. [2022-01-19 00:49:21,075 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 491 selfloop transitions, 91 changer transitions 3/1092 dead transitions. [2022-01-19 00:49:21,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 1092 transitions, 3969 flow [2022-01-19 00:49:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 00:49:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 00:49:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 29387 transitions. [2022-01-19 00:49:21,101 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8217841163310962 [2022-01-19 00:49:21,101 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 29387 transitions. [2022-01-19 00:49:21,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 29387 transitions. [2022-01-19 00:49:21,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:21,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 29387 transitions. [2022-01-19 00:49:21,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 489.78333333333336) internal successors, (29387), 60 states have internal predecessors, (29387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,170 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,170 INFO L186 Difference]: Start difference. First operand has 604 places, 593 transitions, 1656 flow. Second operand 60 states and 29387 transitions. [2022-01-19 00:49:21,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 1092 transitions, 3969 flow [2022-01-19 00:49:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 1092 transitions, 3805 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-01-19 00:49:21,197 INFO L242 Difference]: Finished difference. Result has 686 places, 672 transitions, 2202 flow [2022-01-19 00:49:21,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2202, PETRI_PLACES=686, PETRI_TRANSITIONS=672} [2022-01-19 00:49:21,198 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 159 predicate places. [2022-01-19 00:49:21,198 INFO L470 AbstractCegarLoop]: Abstraction has has 686 places, 672 transitions, 2202 flow [2022-01-19 00:49:21,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,199 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:21,200 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:21,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 00:49:21,200 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1998660648, now seen corresponding path program 2 times [2022-01-19 00:49:21,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557727784] [2022-01-19 00:49:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:21,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:21,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:21,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557727784] [2022-01-19 00:49:21,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557727784] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:21,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:21,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:21,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995821882] [2022-01-19 00:49:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:21,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:21,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:21,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:21,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 672 transitions, 2202 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:21,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:21,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:26,449 INFO L129 PetriNetUnfolder]: 3218/15196 cut-off events. [2022-01-19 00:49:26,450 INFO L130 PetriNetUnfolder]: For 5614/5614 co-relation queries the response was YES. [2022-01-19 00:49:26,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26781 conditions, 15196 events. 3218/15196 cut-off events. For 5614/5614 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 161258 event pairs, 1461 based on Foata normal form. 2/13998 useless extension candidates. Maximal degree in co-relation 26713. Up to 3079 conditions per place. [2022-01-19 00:49:26,565 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 516 selfloop transitions, 138 changer transitions 3/1164 dead transitions. [2022-01-19 00:49:26,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 1164 transitions, 5231 flow [2022-01-19 00:49:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 00:49:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 00:49:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 29379 transitions. [2022-01-19 00:49:26,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8215604026845638 [2022-01-19 00:49:26,585 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 29379 transitions. [2022-01-19 00:49:26,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 29379 transitions. [2022-01-19 00:49:26,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:26,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 29379 transitions. [2022-01-19 00:49:26,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 489.65) internal successors, (29379), 60 states have internal predecessors, (29379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:26,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:26,643 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:26,643 INFO L186 Difference]: Start difference. First operand has 686 places, 672 transitions, 2202 flow. Second operand 60 states and 29379 transitions. [2022-01-19 00:49:26,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 1164 transitions, 5231 flow [2022-01-19 00:49:26,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 1164 transitions, 4847 flow, removed 6 selfloop flow, removed 11 redundant places. [2022-01-19 00:49:26,711 INFO L242 Difference]: Finished difference. Result has 780 places, 752 transitions, 3146 flow [2022-01-19 00:49:26,712 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3146, PETRI_PLACES=780, PETRI_TRANSITIONS=752} [2022-01-19 00:49:26,712 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 253 predicate places. [2022-01-19 00:49:26,712 INFO L470 AbstractCegarLoop]: Abstraction has has 780 places, 752 transitions, 3146 flow [2022-01-19 00:49:26,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:26,714 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:26,714 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:26,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 00:49:26,714 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1909265420, now seen corresponding path program 3 times [2022-01-19 00:49:26,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:26,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484472914] [2022-01-19 00:49:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:26,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:26,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:26,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484472914] [2022-01-19 00:49:26,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484472914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:26,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:26,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:26,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59096301] [2022-01-19 00:49:26,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:26,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:26,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:26,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:26,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:26,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:26,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 752 transitions, 3146 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:26,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:26,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:26,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:32,682 INFO L129 PetriNetUnfolder]: 3399/15884 cut-off events. [2022-01-19 00:49:32,682 INFO L130 PetriNetUnfolder]: For 17069/17069 co-relation queries the response was YES. [2022-01-19 00:49:32,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31400 conditions, 15884 events. 3399/15884 cut-off events. For 17069/17069 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 171499 event pairs, 1434 based on Foata normal form. 2/14548 useless extension candidates. Maximal degree in co-relation 31286. Up to 3100 conditions per place. [2022-01-19 00:49:32,838 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 510 selfloop transitions, 167 changer transitions 3/1187 dead transitions. [2022-01-19 00:49:32,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 837 places, 1187 transitions, 7532 flow [2022-01-19 00:49:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:49:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:49:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28365 transitions. [2022-01-19 00:49:32,852 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8205565841240453 [2022-01-19 00:49:32,852 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28365 transitions. [2022-01-19 00:49:32,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28365 transitions. [2022-01-19 00:49:32,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:32,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28365 transitions. [2022-01-19 00:49:32,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 489.05172413793105) internal successors, (28365), 58 states have internal predecessors, (28365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:32,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:32,909 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:32,909 INFO L186 Difference]: Start difference. First operand has 780 places, 752 transitions, 3146 flow. Second operand 58 states and 28365 transitions. [2022-01-19 00:49:32,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 837 places, 1187 transitions, 7532 flow [2022-01-19 00:49:32,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 1187 transitions, 6793 flow, removed 140 selfloop flow, removed 11 redundant places. [2022-01-19 00:49:33,002 INFO L242 Difference]: Finished difference. Result has 870 places, 829 transitions, 4191 flow [2022-01-19 00:49:33,003 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2722, PETRI_DIFFERENCE_MINUEND_PLACES=769, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=4191, PETRI_PLACES=870, PETRI_TRANSITIONS=829} [2022-01-19 00:49:33,003 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 343 predicate places. [2022-01-19 00:49:33,003 INFO L470 AbstractCegarLoop]: Abstraction has has 870 places, 829 transitions, 4191 flow [2022-01-19 00:49:33,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:33,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:33,005 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:33,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 00:49:33,005 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2003560772, now seen corresponding path program 4 times [2022-01-19 00:49:33,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:33,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639311243] [2022-01-19 00:49:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:33,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:33,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:33,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639311243] [2022-01-19 00:49:33,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639311243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:33,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:33,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:33,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472061230] [2022-01-19 00:49:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:33,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:33,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:33,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:33,209 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:33,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 829 transitions, 4191 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:33,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:33,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:33,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:39,648 INFO L129 PetriNetUnfolder]: 3456/16318 cut-off events. [2022-01-19 00:49:39,648 INFO L130 PetriNetUnfolder]: For 37279/37279 co-relation queries the response was YES. [2022-01-19 00:49:39,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36434 conditions, 16318 events. 3456/16318 cut-off events. For 37279/37279 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 176424 event pairs, 1474 based on Foata normal form. 2/15094 useless extension candidates. Maximal degree in co-relation 36276. Up to 3079 conditions per place. [2022-01-19 00:49:39,889 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 569 selfloop transitions, 206 changer transitions 3/1285 dead transitions. [2022-01-19 00:49:39,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 1285 transitions, 9487 flow [2022-01-19 00:49:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:49:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:49:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28362 transitions. [2022-01-19 00:49:39,905 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8204697986577181 [2022-01-19 00:49:39,905 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28362 transitions. [2022-01-19 00:49:39,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28362 transitions. [2022-01-19 00:49:39,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:39,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28362 transitions. [2022-01-19 00:49:39,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 489.0) internal successors, (28362), 58 states have internal predecessors, (28362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:39,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:39,958 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:39,959 INFO L186 Difference]: Start difference. First operand has 870 places, 829 transitions, 4191 flow. Second operand 58 states and 28362 transitions. [2022-01-19 00:49:39,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 1285 transitions, 9487 flow [2022-01-19 00:49:40,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 1285 transitions, 8557 flow, removed 403 selfloop flow, removed 5 redundant places. [2022-01-19 00:49:40,207 INFO L242 Difference]: Finished difference. Result has 966 places, 906 transitions, 5450 flow [2022-01-19 00:49:40,208 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=3551, PETRI_DIFFERENCE_MINUEND_PLACES=865, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=5450, PETRI_PLACES=966, PETRI_TRANSITIONS=906} [2022-01-19 00:49:40,208 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 439 predicate places. [2022-01-19 00:49:40,208 INFO L470 AbstractCegarLoop]: Abstraction has has 966 places, 906 transitions, 5450 flow [2022-01-19 00:49:40,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,209 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:40,210 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:40,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 00:49:40,210 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash 102389314, now seen corresponding path program 5 times [2022-01-19 00:49:40,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:40,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181609711] [2022-01-19 00:49:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:40,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:40,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:40,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181609711] [2022-01-19 00:49:40,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181609711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:40,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:40,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:40,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214040296] [2022-01-19 00:49:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:40,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:40,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:40,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:40,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 906 transitions, 5450 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:40,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:40,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:47,940 INFO L129 PetriNetUnfolder]: 3676/17045 cut-off events. [2022-01-19 00:49:47,940 INFO L130 PetriNetUnfolder]: For 66191/66191 co-relation queries the response was YES. [2022-01-19 00:49:48,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42224 conditions, 17045 events. 3676/17045 cut-off events. For 66191/66191 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 185542 event pairs, 1553 based on Foata normal form. 2/15691 useless extension candidates. Maximal degree in co-relation 42023. Up to 3100 conditions per place. [2022-01-19 00:49:48,493 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 629 selfloop transitions, 204 changer transitions 3/1343 dead transitions. [2022-01-19 00:49:48,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1343 transitions, 12289 flow [2022-01-19 00:49:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:49:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:49:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28349 transitions. [2022-01-19 00:49:48,508 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8200937283036335 [2022-01-19 00:49:48,508 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28349 transitions. [2022-01-19 00:49:48,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28349 transitions. [2022-01-19 00:49:48,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:48,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28349 transitions. [2022-01-19 00:49:48,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.7758620689655) internal successors, (28349), 58 states have internal predecessors, (28349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,558 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,558 INFO L186 Difference]: Start difference. First operand has 966 places, 906 transitions, 5450 flow. Second operand 58 states and 28349 transitions. [2022-01-19 00:49:48,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1343 transitions, 12289 flow [2022-01-19 00:49:48,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1343 transitions, 10931 flow, removed 607 selfloop flow, removed 5 redundant places. [2022-01-19 00:49:48,962 INFO L242 Difference]: Finished difference. Result has 1063 places, 984 transitions, 6850 flow [2022-01-19 00:49:48,963 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=961, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=6850, PETRI_PLACES=1063, PETRI_TRANSITIONS=984} [2022-01-19 00:49:48,963 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 536 predicate places. [2022-01-19 00:49:48,963 INFO L470 AbstractCegarLoop]: Abstraction has has 1063 places, 984 transitions, 6850 flow [2022-01-19 00:49:48,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:48,965 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:48,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 00:49:48,965 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1378121062, now seen corresponding path program 6 times [2022-01-19 00:49:48,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:48,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127818276] [2022-01-19 00:49:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:48,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:49,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:49,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127818276] [2022-01-19 00:49:49,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127818276] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:49,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:49,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:49,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431217212] [2022-01-19 00:49:49,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:49,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:49,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:49,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:49,188 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:49,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1063 places, 984 transitions, 6850 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:49,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:49,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:49,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:57,529 INFO L129 PetriNetUnfolder]: 3725/17547 cut-off events. [2022-01-19 00:49:57,529 INFO L130 PetriNetUnfolder]: For 108344/108344 co-relation queries the response was YES. [2022-01-19 00:49:57,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48971 conditions, 17547 events. 3725/17547 cut-off events. For 108344/108344 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 192577 event pairs, 1517 based on Foata normal form. 2/16298 useless extension candidates. Maximal degree in co-relation 48726. Up to 3079 conditions per place. [2022-01-19 00:49:57,932 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 699 selfloop transitions, 235 changer transitions 3/1444 dead transitions. [2022-01-19 00:49:57,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1120 places, 1444 transitions, 14804 flow [2022-01-19 00:49:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:49:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:49:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28347 transitions. [2022-01-19 00:49:57,942 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8200358713260819 [2022-01-19 00:49:57,942 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28347 transitions. [2022-01-19 00:49:57,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28347 transitions. [2022-01-19 00:49:57,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:57,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28347 transitions. [2022-01-19 00:49:57,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.7413793103448) internal successors, (28347), 58 states have internal predecessors, (28347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,986 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,986 INFO L186 Difference]: Start difference. First operand has 1063 places, 984 transitions, 6850 flow. Second operand 58 states and 28347 transitions. [2022-01-19 00:49:57,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1120 places, 1444 transitions, 14804 flow [2022-01-19 00:49:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1115 places, 1444 transitions, 13020 flow, removed 820 selfloop flow, removed 5 redundant places. [2022-01-19 00:49:58,807 INFO L242 Difference]: Finished difference. Result has 1160 places, 1062 transitions, 8336 flow [2022-01-19 00:49:58,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=5572, PETRI_DIFFERENCE_MINUEND_PLACES=1058, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=8336, PETRI_PLACES=1160, PETRI_TRANSITIONS=1062} [2022-01-19 00:49:58,809 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 633 predicate places. [2022-01-19 00:49:58,809 INFO L470 AbstractCegarLoop]: Abstraction has has 1160 places, 1062 transitions, 8336 flow [2022-01-19 00:49:58,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:58,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:58,810 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:49:58,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 00:49:58,811 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:49:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:58,811 INFO L85 PathProgramCache]: Analyzing trace with hash -125973380, now seen corresponding path program 7 times [2022-01-19 00:49:58,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:58,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117429173] [2022-01-19 00:49:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:58,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:49:59,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:59,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117429173] [2022-01-19 00:49:59,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117429173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:59,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:59,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:49:59,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144822393] [2022-01-19 00:49:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:59,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:49:59,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:49:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:49:59,018 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:49:59,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1160 places, 1062 transitions, 8336 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:59,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:49:59,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:08,356 INFO L129 PetriNetUnfolder]: 3939/18157 cut-off events. [2022-01-19 00:50:08,356 INFO L130 PetriNetUnfolder]: For 164417/164417 co-relation queries the response was YES. [2022-01-19 00:50:08,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56249 conditions, 18157 events. 3939/18157 cut-off events. For 164417/164417 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 200828 event pairs, 1601 based on Foata normal form. 2/16804 useless extension candidates. Maximal degree in co-relation 55960. Up to 3100 conditions per place. [2022-01-19 00:50:08,931 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 785 selfloop transitions, 203 changer transitions 3/1498 dead transitions. [2022-01-19 00:50:08,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1217 places, 1498 transitions, 17729 flow [2022-01-19 00:50:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:50:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:50:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28334 transitions. [2022-01-19 00:50:08,941 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8196598009719972 [2022-01-19 00:50:08,941 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28334 transitions. [2022-01-19 00:50:08,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28334 transitions. [2022-01-19 00:50:08,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:08,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28334 transitions. [2022-01-19 00:50:08,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.51724137931035) internal successors, (28334), 58 states have internal predecessors, (28334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,985 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,985 INFO L186 Difference]: Start difference. First operand has 1160 places, 1062 transitions, 8336 flow. Second operand 58 states and 28334 transitions. [2022-01-19 00:50:08,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1217 places, 1498 transitions, 17729 flow [2022-01-19 00:50:10,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1212 places, 1498 transitions, 15543 flow, removed 1011 selfloop flow, removed 5 redundant places. [2022-01-19 00:50:10,254 INFO L242 Difference]: Finished difference. Result has 1258 places, 1141 transitions, 9891 flow [2022-01-19 00:50:10,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=6732, PETRI_DIFFERENCE_MINUEND_PLACES=1155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=9891, PETRI_PLACES=1258, PETRI_TRANSITIONS=1141} [2022-01-19 00:50:10,256 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 731 predicate places. [2022-01-19 00:50:10,256 INFO L470 AbstractCegarLoop]: Abstraction has has 1258 places, 1141 transitions, 9891 flow [2022-01-19 00:50:10,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,258 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:10,258 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:50:10,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 00:50:10,258 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:50:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:10,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2073416232, now seen corresponding path program 8 times [2022-01-19 00:50:10,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:10,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858419887] [2022-01-19 00:50:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:10,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:50:10,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:10,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858419887] [2022-01-19 00:50:10,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858419887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:10,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:10,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:50:10,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890902607] [2022-01-19 00:50:10,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:10,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:50:10,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:50:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:50:10,478 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:50:10,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1258 places, 1141 transitions, 9891 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:10,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:50:10,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:20,743 INFO L129 PetriNetUnfolder]: 4041/18768 cut-off events. [2022-01-19 00:50:20,743 INFO L130 PetriNetUnfolder]: For 235480/235480 co-relation queries the response was YES. [2022-01-19 00:50:21,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64359 conditions, 18768 events. 4041/18768 cut-off events. For 235480/235480 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 208498 event pairs, 1611 based on Foata normal form. 2/17511 useless extension candidates. Maximal degree in co-relation 64025. Up to 3079 conditions per place. [2022-01-19 00:50:21,269 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 864 selfloop transitions, 226 changer transitions 3/1600 dead transitions. [2022-01-19 00:50:21,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1315 places, 1600 transitions, 20457 flow [2022-01-19 00:50:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:50:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:50:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28333 transitions. [2022-01-19 00:50:21,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8196308724832215 [2022-01-19 00:50:21,279 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28333 transitions. [2022-01-19 00:50:21,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28333 transitions. [2022-01-19 00:50:21,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:21,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28333 transitions. [2022-01-19 00:50:21,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.5) internal successors, (28333), 58 states have internal predecessors, (28333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:21,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:21,319 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:21,319 INFO L186 Difference]: Start difference. First operand has 1258 places, 1141 transitions, 9891 flow. Second operand 58 states and 28333 transitions. [2022-01-19 00:50:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1315 places, 1600 transitions, 20457 flow [2022-01-19 00:50:23,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1310 places, 1600 transitions, 17783 flow, removed 1255 selfloop flow, removed 5 redundant places. [2022-01-19 00:50:23,475 INFO L242 Difference]: Finished difference. Result has 1356 places, 1220 transitions, 11492 flow [2022-01-19 00:50:23,476 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=7919, PETRI_DIFFERENCE_MINUEND_PLACES=1253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=11492, PETRI_PLACES=1356, PETRI_TRANSITIONS=1220} [2022-01-19 00:50:23,477 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 829 predicate places. [2022-01-19 00:50:23,477 INFO L470 AbstractCegarLoop]: Abstraction has has 1356 places, 1220 transitions, 11492 flow [2022-01-19 00:50:23,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,478 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:23,478 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:50:23,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 00:50:23,478 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:50:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1117320100, now seen corresponding path program 9 times [2022-01-19 00:50:23,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:23,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71094307] [2022-01-19 00:50:23,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:23,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:50:23,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71094307] [2022-01-19 00:50:23,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71094307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:23,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:23,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:50:23,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38543186] [2022-01-19 00:50:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:23,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:50:23,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:50:23,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:50:23,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:50:23,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1356 places, 1220 transitions, 11492 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:23,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:50:23,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:35,408 INFO L129 PetriNetUnfolder]: 4357/20134 cut-off events. [2022-01-19 00:50:35,408 INFO L130 PetriNetUnfolder]: For 328217/328217 co-relation queries the response was YES. [2022-01-19 00:50:35,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73628 conditions, 20134 events. 4357/20134 cut-off events. For 328217/328217 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 225953 event pairs, 1864 based on Foata normal form. 2/18656 useless extension candidates. Maximal degree in co-relation 73249. Up to 3100 conditions per place. [2022-01-19 00:50:35,999 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 983 selfloop transitions, 164 changer transitions 3/1657 dead transitions. [2022-01-19 00:50:35,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1414 places, 1657 transitions, 23392 flow [2022-01-19 00:50:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 00:50:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 00:50:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28808 transitions. [2022-01-19 00:50:36,009 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192469571152314 [2022-01-19 00:50:36,009 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28808 transitions. [2022-01-19 00:50:36,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28808 transitions. [2022-01-19 00:50:36,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:36,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28808 transitions. [2022-01-19 00:50:36,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.271186440678) internal successors, (28808), 59 states have internal predecessors, (28808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,049 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,049 INFO L186 Difference]: Start difference. First operand has 1356 places, 1220 transitions, 11492 flow. Second operand 59 states and 28808 transitions. [2022-01-19 00:50:36,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1414 places, 1657 transitions, 23392 flow [2022-01-19 00:50:39,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1409 places, 1657 transitions, 20374 flow, removed 1417 selfloop flow, removed 5 redundant places. [2022-01-19 00:50:39,336 INFO L242 Difference]: Finished difference. Result has 1456 places, 1300 transitions, 13045 flow [2022-01-19 00:50:39,337 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=9170, PETRI_DIFFERENCE_MINUEND_PLACES=1351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=13045, PETRI_PLACES=1456, PETRI_TRANSITIONS=1300} [2022-01-19 00:50:39,338 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 929 predicate places. [2022-01-19 00:50:39,338 INFO L470 AbstractCegarLoop]: Abstraction has has 1456 places, 1300 transitions, 13045 flow [2022-01-19 00:50:39,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:39,339 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:39,339 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:50:39,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 00:50:39,340 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:50:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1932896218, now seen corresponding path program 10 times [2022-01-19 00:50:39,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:39,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053732520] [2022-01-19 00:50:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:39,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:50:39,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:39,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053732520] [2022-01-19 00:50:39,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053732520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:39,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:39,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:50:39,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048829131] [2022-01-19 00:50:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:39,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:50:39,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:50:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:50:39,559 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:50:39,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1456 places, 1300 transitions, 13045 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:39,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:39,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:50:39,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:52,074 INFO L129 PetriNetUnfolder]: 4403/20232 cut-off events. [2022-01-19 00:50:52,074 INFO L130 PetriNetUnfolder]: For 435276/435276 co-relation queries the response was YES. [2022-01-19 00:50:52,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82641 conditions, 20232 events. 4403/20232 cut-off events. For 435276/435276 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 228558 event pairs, 1764 based on Foata normal form. 2/18949 useless extension candidates. Maximal degree in co-relation 82216. Up to 3079 conditions per place. [2022-01-19 00:50:52,943 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1068 selfloop transitions, 179 changer transitions 3/1757 dead transitions. [2022-01-19 00:50:52,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1514 places, 1757 transitions, 26077 flow [2022-01-19 00:50:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 00:50:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 00:50:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28807 transitions. [2022-01-19 00:50:52,952 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192185189398248 [2022-01-19 00:50:52,952 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28807 transitions. [2022-01-19 00:50:52,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28807 transitions. [2022-01-19 00:50:52,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:52,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28807 transitions. [2022-01-19 00:50:52,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.2542372881356) internal successors, (28807), 59 states have internal predecessors, (28807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:53,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:53,233 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:53,233 INFO L186 Difference]: Start difference. First operand has 1456 places, 1300 transitions, 13045 flow. Second operand 59 states and 28807 transitions. [2022-01-19 00:50:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1514 places, 1757 transitions, 26077 flow [2022-01-19 00:50:59,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1509 places, 1757 transitions, 22533 flow, removed 1680 selfloop flow, removed 5 redundant places. [2022-01-19 00:50:59,876 INFO L242 Difference]: Finished difference. Result has 1556 places, 1380 transitions, 14600 flow [2022-01-19 00:50:59,877 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=10323, PETRI_DIFFERENCE_MINUEND_PLACES=1451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=14600, PETRI_PLACES=1556, PETRI_TRANSITIONS=1380} [2022-01-19 00:50:59,877 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1029 predicate places. [2022-01-19 00:50:59,877 INFO L470 AbstractCegarLoop]: Abstraction has has 1556 places, 1380 transitions, 14600 flow [2022-01-19 00:50:59,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:59,878 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:59,879 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:50:59,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 00:50:59,879 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:50:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -709051800, now seen corresponding path program 11 times [2022-01-19 00:50:59,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:59,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494164843] [2022-01-19 00:50:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:59,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:51:00,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:00,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494164843] [2022-01-19 00:51:00,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494164843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:00,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:00,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:51:00,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000458584] [2022-01-19 00:51:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:00,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:51:00,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:51:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:51:00,098 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:51:00,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1556 places, 1380 transitions, 14600 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:00,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:00,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:51:00,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:14,405 INFO L129 PetriNetUnfolder]: 4692/21162 cut-off events. [2022-01-19 00:51:14,405 INFO L130 PetriNetUnfolder]: For 578318/578322 co-relation queries the response was YES. [2022-01-19 00:51:15,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93437 conditions, 21162 events. 4692/21162 cut-off events. For 578318/578322 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 242340 event pairs, 1903 based on Foata normal form. 2/19732 useless extension candidates. Maximal degree in co-relation 92966. Up to 3100 conditions per place. [2022-01-19 00:51:15,244 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1128 selfloop transitions, 162 changer transitions 3/1800 dead transitions. [2022-01-19 00:51:15,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1614 places, 1800 transitions, 28696 flow [2022-01-19 00:51:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 00:51:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 00:51:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28793 transitions. [2022-01-19 00:51:15,254 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8188203844841315 [2022-01-19 00:51:15,254 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28793 transitions. [2022-01-19 00:51:15,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28793 transitions. [2022-01-19 00:51:15,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:15,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28793 transitions. [2022-01-19 00:51:15,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.0169491525424) internal successors, (28793), 59 states have internal predecessors, (28793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:15,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:15,291 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:15,291 INFO L186 Difference]: Start difference. First operand has 1556 places, 1380 transitions, 14600 flow. Second operand 59 states and 28793 transitions. [2022-01-19 00:51:15,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1614 places, 1800 transitions, 28696 flow [2022-01-19 00:51:22,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1609 places, 1800 transitions, 24910 flow, removed 1791 selfloop flow, removed 5 redundant places. [2022-01-19 00:51:22,711 INFO L242 Difference]: Finished difference. Result has 1657 places, 1461 transitions, 16204 flow [2022-01-19 00:51:22,712 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=11504, PETRI_DIFFERENCE_MINUEND_PLACES=1551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=16204, PETRI_PLACES=1657, PETRI_TRANSITIONS=1461} [2022-01-19 00:51:22,712 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1130 predicate places. [2022-01-19 00:51:22,712 INFO L470 AbstractCegarLoop]: Abstraction has has 1657 places, 1461 transitions, 16204 flow [2022-01-19 00:51:22,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:22,713 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:22,713 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:51:22,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 00:51:22,714 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:51:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -931781678, now seen corresponding path program 12 times [2022-01-19 00:51:22,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:22,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492014962] [2022-01-19 00:51:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:22,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:51:22,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:22,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492014962] [2022-01-19 00:51:22,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492014962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:22,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:22,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:51:22,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149770635] [2022-01-19 00:51:22,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:22,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:51:22,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:51:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:51:22,933 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:51:22,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1657 places, 1461 transitions, 16204 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:22,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:22,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:51:22,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:38,216 INFO L129 PetriNetUnfolder]: 4858/21997 cut-off events. [2022-01-19 00:51:38,216 INFO L130 PetriNetUnfolder]: For 737215/737225 co-relation queries the response was YES. [2022-01-19 00:51:39,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105255 conditions, 21997 events. 4858/21997 cut-off events. For 737215/737225 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 253782 event pairs, 1903 based on Foata normal form. 2/20680 useless extension candidates. Maximal degree in co-relation 104737. Up to 3079 conditions per place. [2022-01-19 00:51:39,362 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1214 selfloop transitions, 173 changer transitions 3/1897 dead transitions. [2022-01-19 00:51:39,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1715 places, 1897 transitions, 31361 flow [2022-01-19 00:51:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 00:51:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 00:51:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28793 transitions. [2022-01-19 00:51:39,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8188203844841315 [2022-01-19 00:51:39,372 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28793 transitions. [2022-01-19 00:51:39,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28793 transitions. [2022-01-19 00:51:39,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:39,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28793 transitions. [2022-01-19 00:51:39,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.0169491525424) internal successors, (28793), 59 states have internal predecessors, (28793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:39,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:39,416 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:39,417 INFO L186 Difference]: Start difference. First operand has 1657 places, 1461 transitions, 16204 flow. Second operand 59 states and 28793 transitions. [2022-01-19 00:51:39,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1715 places, 1897 transitions, 31361 flow [2022-01-19 00:51:50,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1711 places, 1897 transitions, 27107 flow, removed 2062 selfloop flow, removed 4 redundant places. [2022-01-19 00:51:50,100 INFO L242 Difference]: Finished difference. Result has 1759 places, 1542 transitions, 17826 flow [2022-01-19 00:51:50,101 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=12716, PETRI_DIFFERENCE_MINUEND_PLACES=1653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=17826, PETRI_PLACES=1759, PETRI_TRANSITIONS=1542} [2022-01-19 00:51:50,101 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1232 predicate places. [2022-01-19 00:51:50,101 INFO L470 AbstractCegarLoop]: Abstraction has has 1759 places, 1542 transitions, 17826 flow [2022-01-19 00:51:50,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:50,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:50,102 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:51:50,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 00:51:50,103 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:51:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1453746146, now seen corresponding path program 13 times [2022-01-19 00:51:50,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:50,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656172633] [2022-01-19 00:51:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:50,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:51:50,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:50,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656172633] [2022-01-19 00:51:50,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656172633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:50,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:50,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:51:50,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357046418] [2022-01-19 00:51:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:50,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:51:50,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:50,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:51:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:51:50,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:51:50,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1759 places, 1542 transitions, 17826 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:50,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:50,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:51:50,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:52:07,373 INFO L129 PetriNetUnfolder]: 5023/23123 cut-off events. [2022-01-19 00:52:07,373 INFO L130 PetriNetUnfolder]: For 823103/823119 co-relation queries the response was YES. [2022-01-19 00:52:08,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108241 conditions, 23123 events. 5023/23123 cut-off events. For 823103/823119 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 268740 event pairs, 1777 based on Foata normal form. 8/21573 useless extension candidates. Maximal degree in co-relation 107676. Up to 3100 conditions per place. [2022-01-19 00:52:08,962 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1079 selfloop transitions, 542 changer transitions 3/2131 dead transitions. [2022-01-19 00:52:08,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1813 places, 2131 transitions, 35440 flow [2022-01-19 00:52:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-19 00:52:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-01-19 00:52:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 26907 transitions. [2022-01-19 00:52:08,971 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8208358755338621 [2022-01-19 00:52:08,971 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 26907 transitions. [2022-01-19 00:52:08,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 26907 transitions. [2022-01-19 00:52:08,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:52:08,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 26907 transitions. [2022-01-19 00:52:08,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 489.2181818181818) internal successors, (26907), 55 states have internal predecessors, (26907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:09,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 596.0) internal successors, (33376), 56 states have internal predecessors, (33376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:09,006 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 596.0) internal successors, (33376), 56 states have internal predecessors, (33376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:09,006 INFO L186 Difference]: Start difference. First operand has 1759 places, 1542 transitions, 17826 flow. Second operand 55 states and 26907 transitions. [2022-01-19 00:52:09,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1813 places, 2131 transitions, 35440 flow [2022-01-19 00:52:21,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1809 places, 2131 transitions, 29030 flow, removed 3140 selfloop flow, removed 4 redundant places. [2022-01-19 00:52:21,954 INFO L242 Difference]: Finished difference. Result has 1849 places, 1611 transitions, 17873 flow [2022-01-19 00:52:21,955 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=13956, PETRI_DIFFERENCE_MINUEND_PLACES=1755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=473, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=17873, PETRI_PLACES=1849, PETRI_TRANSITIONS=1611} [2022-01-19 00:52:21,956 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1322 predicate places. [2022-01-19 00:52:21,956 INFO L470 AbstractCegarLoop]: Abstraction has has 1849 places, 1611 transitions, 17873 flow [2022-01-19 00:52:21,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:21,957 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:52:21,957 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:52:21,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 00:52:21,957 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:52:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:52:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1129447238, now seen corresponding path program 14 times [2022-01-19 00:52:21,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:52:21,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222969635] [2022-01-19 00:52:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:52:21,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:52:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:52:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:52:22,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:52:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222969635] [2022-01-19 00:52:22,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222969635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:52:22,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:52:22,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:52:22,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920340870] [2022-01-19 00:52:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:52:22,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:52:22,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:52:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:52:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:52:22,241 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:52:22,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1849 places, 1611 transitions, 17873 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:22,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:52:22,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:52:22,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:52:41,482 INFO L129 PetriNetUnfolder]: 5393/24036 cut-off events. [2022-01-19 00:52:41,483 INFO L130 PetriNetUnfolder]: For 1206226/1206264 co-relation queries the response was YES. [2022-01-19 00:52:43,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134667 conditions, 24036 events. 5393/24036 cut-off events. For 1206226/1206264 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 281334 event pairs, 2355 based on Foata normal form. 5/22617 useless extension candidates. Maximal degree in co-relation 134063. Up to 3341 conditions per place. [2022-01-19 00:52:43,094 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1357 selfloop transitions, 150 changer transitions 3/2017 dead transitions. [2022-01-19 00:52:43,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1906 places, 2017 transitions, 35061 flow [2022-01-19 00:52:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:52:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:52:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28318 transitions. [2022-01-19 00:52:43,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8191969451515853 [2022-01-19 00:52:43,103 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28318 transitions. [2022-01-19 00:52:43,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28318 transitions. [2022-01-19 00:52:43,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:52:43,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28318 transitions. [2022-01-19 00:52:43,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.2413793103448) internal successors, (28318), 58 states have internal predecessors, (28318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:43,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:43,138 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:43,138 INFO L186 Difference]: Start difference. First operand has 1849 places, 1611 transitions, 17873 flow. Second operand 58 states and 28318 transitions. [2022-01-19 00:52:43,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1906 places, 2017 transitions, 35061 flow [2022-01-19 00:52:59,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1900 places, 2017 transitions, 32632 flow, removed 997 selfloop flow, removed 6 redundant places. [2022-01-19 00:52:59,970 INFO L242 Difference]: Finished difference. Result has 1946 places, 1695 transitions, 21597 flow [2022-01-19 00:52:59,971 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=15587, PETRI_DIFFERENCE_MINUEND_PLACES=1843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=21597, PETRI_PLACES=1946, PETRI_TRANSITIONS=1695} [2022-01-19 00:52:59,971 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1419 predicate places. [2022-01-19 00:52:59,971 INFO L470 AbstractCegarLoop]: Abstraction has has 1946 places, 1695 transitions, 21597 flow [2022-01-19 00:52:59,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:59,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:52:59,973 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:52:59,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 00:52:59,973 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:52:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:52:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1579267606, now seen corresponding path program 15 times [2022-01-19 00:52:59,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:52:59,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19463807] [2022-01-19 00:52:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:52:59,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:52:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:53:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:53:00,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:53:00,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19463807] [2022-01-19 00:53:00,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19463807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:53:00,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:53:00,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:53:00,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861608199] [2022-01-19 00:53:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:53:00,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:53:00,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:53:00,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:53:00,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:53:00,194 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:53:00,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1946 places, 1695 transitions, 21597 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:00,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:53:00,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:53:00,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:53:22,190 INFO L129 PetriNetUnfolder]: 5498/24658 cut-off events. [2022-01-19 00:53:22,191 INFO L130 PetriNetUnfolder]: For 1379596/1379638 co-relation queries the response was YES. [2022-01-19 00:53:23,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141515 conditions, 24658 events. 5498/24658 cut-off events. For 1379596/1379638 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 291454 event pairs, 1803 based on Foata normal form. 10/23081 useless extension candidates. Maximal degree in co-relation 140866. Up to 3100 conditions per place. [2022-01-19 00:53:23,799 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1240 selfloop transitions, 460 changer transitions 3/2210 dead transitions. [2022-01-19 00:53:23,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1975 places, 2210 transitions, 39095 flow [2022-01-19 00:53:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 00:53:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 00:53:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14800 transitions. [2022-01-19 00:53:23,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8277404921700223 [2022-01-19 00:53:23,805 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 14800 transitions. [2022-01-19 00:53:23,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 14800 transitions. [2022-01-19 00:53:23,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:53:23,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 14800 transitions. [2022-01-19 00:53:23,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 493.3333333333333) internal successors, (14800), 30 states have internal predecessors, (14800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:23,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 596.0) internal successors, (18476), 31 states have internal predecessors, (18476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:23,821 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 596.0) internal successors, (18476), 31 states have internal predecessors, (18476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:23,822 INFO L186 Difference]: Start difference. First operand has 1946 places, 1695 transitions, 21597 flow. Second operand 30 states and 14800 transitions. [2022-01-19 00:53:23,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1975 places, 2210 transitions, 39095 flow [2022-01-19 00:53:46,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1972 places, 2210 transitions, 30650 flow, removed 4192 selfloop flow, removed 3 redundant places. [2022-01-19 00:53:46,213 INFO L242 Difference]: Finished difference. Result has 1988 places, 1729 transitions, 19221 flow [2022-01-19 00:53:46,215 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=17002, PETRI_DIFFERENCE_MINUEND_PLACES=1943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=426, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=19221, PETRI_PLACES=1988, PETRI_TRANSITIONS=1729} [2022-01-19 00:53:46,215 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1461 predicate places. [2022-01-19 00:53:46,215 INFO L470 AbstractCegarLoop]: Abstraction has has 1988 places, 1729 transitions, 19221 flow [2022-01-19 00:53:46,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:46,216 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:53:46,216 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:53:46,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-19 00:53:46,216 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:53:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:53:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1417894316, now seen corresponding path program 16 times [2022-01-19 00:53:46,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:53:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748499498] [2022-01-19 00:53:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:53:46,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:53:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:53:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:53:46,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:53:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748499498] [2022-01-19 00:53:46,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748499498] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:53:46,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:53:46,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:53:46,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961780176] [2022-01-19 00:53:46,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:53:46,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:53:46,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:53:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:53:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:53:46,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:53:46,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1988 places, 1729 transitions, 19221 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:46,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:53:46,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:53:46,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:54:12,533 INFO L129 PetriNetUnfolder]: 6170/27545 cut-off events. [2022-01-19 00:54:12,533 INFO L130 PetriNetUnfolder]: For 1768968/1769032 co-relation queries the response was YES. [2022-01-19 00:54:16,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167710 conditions, 27545 events. 6170/27545 cut-off events. For 1768968/1769032 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 327860 event pairs, 3561 based on Foata normal form. 6/25813 useless extension candidates. Maximal degree in co-relation 167046. Up to 3961 conditions per place. [2022-01-19 00:54:17,006 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1458 selfloop transitions, 131 changer transitions 3/2099 dead transitions. [2022-01-19 00:54:17,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2045 places, 2099 transitions, 38229 flow [2022-01-19 00:54:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:54:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:54:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28304 transitions. [2022-01-19 00:54:17,016 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8187919463087249 [2022-01-19 00:54:17,016 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28304 transitions. [2022-01-19 00:54:17,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28304 transitions. [2022-01-19 00:54:17,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:54:17,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28304 transitions. [2022-01-19 00:54:17,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.0) internal successors, (28304), 58 states have internal predecessors, (28304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:17,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:17,067 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:17,068 INFO L186 Difference]: Start difference. First operand has 1988 places, 1729 transitions, 19221 flow. Second operand 58 states and 28304 transitions. [2022-01-19 00:54:17,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2045 places, 2099 transitions, 38229 flow [2022-01-19 00:54:42,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2039 places, 2099 transitions, 37009 flow, removed 435 selfloop flow, removed 6 redundant places. [2022-01-19 00:54:42,417 INFO L242 Difference]: Finished difference. Result has 2086 places, 1814 transitions, 24741 flow [2022-01-19 00:54:42,418 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=18152, PETRI_DIFFERENCE_MINUEND_PLACES=1982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=24741, PETRI_PLACES=2086, PETRI_TRANSITIONS=1814} [2022-01-19 00:54:42,418 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1559 predicate places. [2022-01-19 00:54:42,418 INFO L470 AbstractCegarLoop]: Abstraction has has 2086 places, 1814 transitions, 24741 flow [2022-01-19 00:54:42,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:42,419 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:54:42,419 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:54:42,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-19 00:54:42,419 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:54:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:54:42,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1999198820, now seen corresponding path program 17 times [2022-01-19 00:54:42,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:54:42,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265706772] [2022-01-19 00:54:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:54:42,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:54:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:54:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:54:42,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:54:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265706772] [2022-01-19 00:54:42,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265706772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:54:42,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:54:42,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:54:42,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805197506] [2022-01-19 00:54:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:54:42,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:54:42,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:54:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:54:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:54:42,605 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:54:42,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2086 places, 1814 transitions, 24741 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:42,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:54:42,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:54:42,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:55:06,285 INFO L129 PetriNetUnfolder]: 6076/26963 cut-off events. [2022-01-19 00:55:06,285 INFO L130 PetriNetUnfolder]: For 1926270/1926337 co-relation queries the response was YES. [2022-01-19 00:55:09,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174509 conditions, 26963 events. 6076/26963 cut-off events. For 1926270/1926337 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 323732 event pairs, 1928 based on Foata normal form. 17/25335 useless extension candidates. Maximal degree in co-relation 173799. Up to 3100 conditions per place. [2022-01-19 00:55:09,212 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1333 selfloop transitions, 588 changer transitions 3/2431 dead transitions. [2022-01-19 00:55:09,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2121 places, 2431 transitions, 44209 flow [2022-01-19 00:55:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 00:55:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 00:55:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17681 transitions. [2022-01-19 00:55:09,218 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.824058538404176 [2022-01-19 00:55:09,219 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 17681 transitions. [2022-01-19 00:55:09,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 17681 transitions. [2022-01-19 00:55:09,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:55:09,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 17681 transitions. [2022-01-19 00:55:09,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 491.1388888888889) internal successors, (17681), 36 states have internal predecessors, (17681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:09,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 596.0) internal successors, (22052), 37 states have internal predecessors, (22052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:09,239 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 596.0) internal successors, (22052), 37 states have internal predecessors, (22052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:09,240 INFO L186 Difference]: Start difference. First operand has 2086 places, 1814 transitions, 24741 flow. Second operand 36 states and 17681 transitions. [2022-01-19 00:55:09,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2121 places, 2431 transitions, 44209 flow [2022-01-19 00:55:45,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2119 places, 2431 transitions, 34630 flow, removed 4782 selfloop flow, removed 2 redundant places. [2022-01-19 00:55:45,696 INFO L242 Difference]: Finished difference. Result has 2143 places, 1873 transitions, 23211 flow [2022-01-19 00:55:45,697 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=19608, PETRI_DIFFERENCE_MINUEND_PLACES=2084, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=529, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=23211, PETRI_PLACES=2143, PETRI_TRANSITIONS=1873} [2022-01-19 00:55:45,697 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1616 predicate places. [2022-01-19 00:55:45,697 INFO L470 AbstractCegarLoop]: Abstraction has has 2143 places, 1873 transitions, 23211 flow [2022-01-19 00:55:45,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:45,698 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:55:45,699 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:55:45,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-19 00:55:45,699 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:55:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:55:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2050598446, now seen corresponding path program 18 times [2022-01-19 00:55:45,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:55:45,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201555549] [2022-01-19 00:55:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:55:45,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:55:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:55:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:55:45,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:55:45,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201555549] [2022-01-19 00:55:45,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201555549] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:55:45,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:55:45,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:55:45,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271224878] [2022-01-19 00:55:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:55:45,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:55:45,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:55:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:55:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:55:45,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:55:45,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2143 places, 1873 transitions, 23211 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:45,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:55:45,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:55:45,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:56:12,309 INFO L129 PetriNetUnfolder]: 6081/26444 cut-off events. [2022-01-19 00:56:12,309 INFO L130 PetriNetUnfolder]: For 1925762/1925863 co-relation queries the response was YES. [2022-01-19 00:56:13,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171325 conditions, 26444 events. 6081/26444 cut-off events. For 1925762/1925863 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 315812 event pairs, 2848 based on Foata normal form. 9/24915 useless extension candidates. Maximal degree in co-relation 170592. Up to 5340 conditions per place. [2022-01-19 00:56:14,270 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1523 selfloop transitions, 449 changer transitions 3/2482 dead transitions. [2022-01-19 00:56:14,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2200 places, 2482 transitions, 47081 flow [2022-01-19 00:56:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 00:56:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 00:56:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28265 transitions. [2022-01-19 00:56:14,285 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8176637352464707 [2022-01-19 00:56:14,285 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28265 transitions. [2022-01-19 00:56:14,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28265 transitions. [2022-01-19 00:56:14,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:56:14,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28265 transitions. [2022-01-19 00:56:14,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 487.32758620689657) internal successors, (28265), 58 states have internal predecessors, (28265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:14,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:14,320 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:14,321 INFO L186 Difference]: Start difference. First operand has 2143 places, 1873 transitions, 23211 flow. Second operand 58 states and 28265 transitions. [2022-01-19 00:56:14,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2200 places, 2482 transitions, 47081 flow [2022-01-19 00:56:45,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2195 places, 2482 transitions, 45299 flow, removed 707 selfloop flow, removed 5 redundant places. [2022-01-19 00:56:45,640 INFO L242 Difference]: Finished difference. Result has 2245 places, 1955 transitions, 29952 flow [2022-01-19 00:56:45,641 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=21758, PETRI_DIFFERENCE_MINUEND_PLACES=2138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=29952, PETRI_PLACES=2245, PETRI_TRANSITIONS=1955} [2022-01-19 00:56:45,641 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1718 predicate places. [2022-01-19 00:56:45,642 INFO L470 AbstractCegarLoop]: Abstraction has has 2245 places, 1955 transitions, 29952 flow [2022-01-19 00:56:45,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:45,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:56:45,643 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:56:45,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-19 00:56:45,643 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:56:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:56:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1554308756, now seen corresponding path program 19 times [2022-01-19 00:56:45,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:56:45,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891003727] [2022-01-19 00:56:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:56:45,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:56:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:56:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:56:45,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:56:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891003727] [2022-01-19 00:56:45,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891003727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:56:45,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:56:45,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:56:45,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488105969] [2022-01-19 00:56:45,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:56:45,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:56:45,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:56:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:56:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:56:45,854 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:56:45,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2245 places, 1955 transitions, 29952 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:45,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:56:45,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:56:45,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:57:14,301 INFO L129 PetriNetUnfolder]: 6239/28194 cut-off events. [2022-01-19 00:57:14,301 INFO L130 PetriNetUnfolder]: For 1949828/1949920 co-relation queries the response was YES. [2022-01-19 00:57:17,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177882 conditions, 28194 events. 6239/28194 cut-off events. For 1949828/1949920 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 342419 event pairs, 2186 based on Foata normal form. 16/26465 useless extension candidates. Maximal degree in co-relation 177100. Up to 5058 conditions per place. [2022-01-19 00:57:17,397 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1686 selfloop transitions, 235 changer transitions 3/2431 dead transitions. [2022-01-19 00:57:17,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2301 places, 2431 transitions, 47488 flow [2022-01-19 00:57:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-19 00:57:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-01-19 00:57:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 27840 transitions. [2022-01-19 00:57:17,406 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8194984104556694 [2022-01-19 00:57:17,406 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 27840 transitions. [2022-01-19 00:57:17,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 27840 transitions. [2022-01-19 00:57:17,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:57:17,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 27840 transitions. [2022-01-19 00:57:17,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 488.42105263157896) internal successors, (27840), 57 states have internal predecessors, (27840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:17,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 596.0) internal successors, (34568), 58 states have internal predecessors, (34568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:17,440 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 596.0) internal successors, (34568), 58 states have internal predecessors, (34568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:17,440 INFO L186 Difference]: Start difference. First operand has 2245 places, 1955 transitions, 29952 flow. Second operand 57 states and 27840 transitions. [2022-01-19 00:57:17,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2301 places, 2431 transitions, 47488 flow [2022-01-19 00:57:56,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2299 places, 2431 transitions, 39139 flow, removed 4167 selfloop flow, removed 2 redundant places. [2022-01-19 00:57:56,579 INFO L242 Difference]: Finished difference. Result has 2339 places, 2025 transitions, 27745 flow [2022-01-19 00:57:56,581 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=24363, PETRI_DIFFERENCE_MINUEND_PLACES=2243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=27745, PETRI_PLACES=2339, PETRI_TRANSITIONS=2025} [2022-01-19 00:57:56,581 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1812 predicate places. [2022-01-19 00:57:56,581 INFO L470 AbstractCegarLoop]: Abstraction has has 2339 places, 2025 transitions, 27745 flow [2022-01-19 00:57:56,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:56,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:57:56,583 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2022-01-19 00:57:56,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-19 00:57:56,583 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:57:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:57:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash -257923188, now seen corresponding path program 20 times [2022-01-19 00:57:56,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:57:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531969908] [2022-01-19 00:57:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:57:56,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:57:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:57:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 00:57:56,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:57:56,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531969908] [2022-01-19 00:57:56,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531969908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:57:56,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:57:56,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 00:57:56,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186206999] [2022-01-19 00:57:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:57:56,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 00:57:56,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:57:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 00:57:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 00:57:56,806 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 00:57:56,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2339 places, 2025 transitions, 27745 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:56,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:57:56,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 00:57:56,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand