/usr/bin/java -Xmx8000000000 -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/parallel-lamport.wvr.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-?-3902331-m
[2022-09-20 22:58:11,876 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-09-20 22:58:11,878 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-09-20 22:58:11,914 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-09-20 22:58:11,914 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-09-20 22:58:11,917 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-09-20 22:58:11,919 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-09-20 22:58:11,921 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-09-20 22:58:11,923 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-09-20 22:58:11,926 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-09-20 22:58:11,928 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-09-20 22:58:11,929 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-09-20 22:58:11,929 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-09-20 22:58:11,930 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-09-20 22:58:11,932 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-09-20 22:58:11,934 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-09-20 22:58:11,934 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-09-20 22:58:11,935 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-09-20 22:58:11,937 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-09-20 22:58:11,941 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-09-20 22:58:11,942 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-09-20 22:58:11,943 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-09-20 22:58:11,945 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-09-20 22:58:11,946 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-09-20 22:58:11,949 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-09-20 22:58:11,950 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-09-20 22:58:11,950 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-09-20 22:58:11,951 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-09-20 22:58:11,951 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-09-20 22:58:11,952 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-09-20 22:58:11,952 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-09-20 22:58:11,953 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-09-20 22:58:11,954 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-09-20 22:58:11,954 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-09-20 22:58:11,955 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-09-20 22:58:11,955 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-09-20 22:58:11,956 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-09-20 22:58:11,956 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-09-20 22:58:11,956 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-09-20 22:58:11,956 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-09-20 22:58:11,957 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-09-20 22:58:11,958 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-09-20 22:58:11,983 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-09-20 22:58:11,983 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-09-20 22:58:11,984 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-09-20 22:58:11,984 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-09-20 22:58:11,985 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-09-20 22:58:11,985 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-09-20 22:58:11,985 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-09-20 22:58:11,985 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-09-20 22:58:11,985 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-09-20 22:58:11,985 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-09-20 22:58:11,986 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-09-20 22:58:11,987 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-09-20 22:58:11,987 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-09-20 22:58:11,987 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-09-20 22:58:11,987 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-09-20 22:58:11,987 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-09-20 22:58:11,987 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-09-20 22:58:11,987 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-09-20 22:58:11,988 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-09-20 22:58:11,988 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-09-20 22:58:11,988 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-09-20 22:58:11,988 INFO  L138        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2022-09-20 22:58:11,989 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2022-09-20 22:58:11,989 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-09-20 22:58:12,151 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-09-20 22:58:12,166 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-09-20 22:58:12,168 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-09-20 22:58:12,169 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-09-20 22:58:12,169 INFO  L275        PluginConnector]: CDTParser initialized
[2022-09-20 22:58:12,170 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c
[2022-09-20 22:58:12,221 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad471981/e487c5dd181a438990a8b9dfbc7b8c4a/FLAGe4a42d36b
[2022-09-20 22:58:12,638 INFO  L306              CDTParser]: Found 1 translation units.
[2022-09-20 22:58:12,638 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c
[2022-09-20 22:58:12,645 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad471981/e487c5dd181a438990a8b9dfbc7b8c4a/FLAGe4a42d36b
[2022-09-20 22:58:12,656 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad471981/e487c5dd181a438990a8b9dfbc7b8c4a
[2022-09-20 22:58:12,659 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-09-20 22:58:12,660 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-09-20 22:58:12,662 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-09-20 22:58:12,662 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-09-20 22:58:12,664 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-09-20 22:58:12,665 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:12,666 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3f30a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12, skipping insertion in model container
[2022-09-20 22:58:12,666 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:12,670 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-09-20 22:58:12,694 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-09-20 22:58:12,874 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/parallel-lamport.wvr.c[4210,4223]
[2022-09-20 22:58:12,887 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-09-20 22:58:12,894 INFO  L203         MainTranslator]: Completed pre-run
[2022-09-20 22:58:12,925 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/parallel-lamport.wvr.c[4210,4223]
[2022-09-20 22:58:12,927 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-09-20 22:58:12,938 INFO  L208         MainTranslator]: Completed translation
[2022-09-20 22:58:12,940 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12 WrapperNode
[2022-09-20 22:58:12,940 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-09-20 22:58:12,941 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-09-20 22:58:12,941 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-09-20 22:58:12,941 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-09-20 22:58:12,946 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:12,960 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:12,986 INFO  L138                Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235
[2022-09-20 22:58:12,987 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-09-20 22:58:12,988 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-09-20 22:58:12,988 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-09-20 22:58:12,988 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-09-20 22:58:12,994 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:12,994 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,006 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,006 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,019 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,022 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,023 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,024 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-09-20 22:58:13,025 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-09-20 22:58:13,025 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-09-20 22:58:13,025 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-09-20 22:58:13,032 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (1/1) ...
[2022-09-20 22:58:13,036 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-09-20 22:58:13,044 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 22:58:13,072 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-09-20 22:58:13,119 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-09-20 22:58:13,145 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2022-09-20 22:58:13,146 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2022-09-20 22:58:13,146 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2022-09-20 22:58:13,146 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-09-20 22:58:13,146 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-09-20 22:58:13,147 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-09-20 22:58:13,147 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-09-20 22:58:13,147 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-09-20 22:58:13,147 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-09-20 22:58:13,148 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-09-20 22:58:13,223 INFO  L234             CfgBuilder]: Building ICFG
[2022-09-20 22:58:13,224 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-09-20 22:58:13,507 INFO  L275             CfgBuilder]: Performing block encoding
[2022-09-20 22:58:13,561 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-09-20 22:58:13,561 INFO  L299             CfgBuilder]: Removed 1 assume(true) statements.
[2022-09-20 22:58:13,568 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:58:13 BoogieIcfgContainer
[2022-09-20 22:58:13,569 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-09-20 22:58:13,571 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-09-20 22:58:13,571 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-09-20 22:58:13,573 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-09-20 22:58:13,573 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:58:12" (1/3) ...
[2022-09-20 22:58:13,574 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d8cd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:58:13, skipping insertion in model container
[2022-09-20 22:58:13,574 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:58:12" (2/3) ...
[2022-09-20 22:58:13,574 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d8cd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:58:13, skipping insertion in model container
[2022-09-20 22:58:13,574 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:58:13" (3/3) ...
[2022-09-20 22:58:13,575 INFO  L112   eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c
[2022-09-20 22:58:13,586 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-09-20 22:58:13,586 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-09-20 22:58:13,587 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-09-20 22:58:13,644 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2022-09-20 22:58:13,679 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 189 places, 186 transitions, 396 flow
[2022-09-20 22:58:13,770 INFO  L130       PetriNetUnfolder]: 7/183 cut-off events.
[2022-09-20 22:58:13,771 INFO  L131       PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-09-20 22:58:13,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 196 conditions, 183 events. 7/183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. 
[2022-09-20 22:58:13,775 INFO  L82        GeneralOperation]: Start removeDead. Operand has 189 places, 186 transitions, 396 flow
[2022-09-20 22:58:13,785 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 175 places, 172 transitions, 362 flow
[2022-09-20 22:58:13,799 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-09-20 22:58:13,805 INFO  L357      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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67504016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-09-20 22:58:13,806 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2022-09-20 22:58:13,841 INFO  L130       PetriNetUnfolder]: 7/171 cut-off events.
[2022-09-20 22:58:13,841 INFO  L131       PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-09-20 22:58:13,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:13,842 INFO  L208   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]
[2022-09-20 22:58:13,842 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:13,849 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:13,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217433655, now seen corresponding path program 1 times
[2022-09-20 22:58:13,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:13,856 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212083205]
[2022-09-20 22:58:13,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:13,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:14,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:14,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:14,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:14,338 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212083205]
[2022-09-20 22:58:14,339 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212083205] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 22:58:14,339 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-09-20 22:58:14,339 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-09-20 22:58:14,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708749450]
[2022-09-20 22:58:14,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 22:58:14,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-09-20 22:58:14,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:14,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-09-20 22:58:14,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-09-20 22:58:14,375 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 186
[2022-09-20 22:58:14,379 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 362 flow. Second operand  has 8 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:14,379 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:14,379 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 186
[2022-09-20 22:58:14,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:14,690 INFO  L130       PetriNetUnfolder]: 312/879 cut-off events.
[2022-09-20 22:58:14,690 INFO  L131       PetriNetUnfolder]: For 130/130 co-relation queries the response was YES.
[2022-09-20 22:58:14,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 879 events. 312/879 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4465 event pairs, 311 based on Foata normal form. 7/875 useless extension candidates. Maximal degree in co-relation 1307. Up to 559 conditions per place. 
[2022-09-20 22:58:14,697 INFO  L137   encePairwiseOnDemand]: 169/186 looper letters, 51 selfloop transitions, 6 changer transitions 15/180 dead transitions.
[2022-09-20 22:58:14,698 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 522 flow
[2022-09-20 22:58:14,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-09-20 22:58:14,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-09-20 22:58:14,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1292 transitions.
[2022-09-20 22:58:14,710 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.6946236559139785
[2022-09-20 22:58:14,711 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1292 transitions.
[2022-09-20 22:58:14,711 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1292 transitions.
[2022-09-20 22:58:14,713 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:14,714 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1292 transitions.
[2022-09-20 22:58:14,719 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 129.2) internal successors, (1292), 10 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:14,725 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:14,726 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:14,727 INFO  L175             Difference]: Start difference. First operand has 175 places, 172 transitions, 362 flow. Second operand 10 states and 1292 transitions.
[2022-09-20 22:58:14,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 522 flow
[2022-09-20 22:58:14,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 180 transitions, 510 flow, removed 0 selfloop flow, removed 6 redundant places.
[2022-09-20 22:58:14,734 INFO  L231             Difference]: Finished difference. Result has 182 places, 162 transitions, 354 flow
[2022-09-20 22:58:14,736 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=354, PETRI_PLACES=182, PETRI_TRANSITIONS=162}
[2022-09-20 22:58:14,738 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 7 predicate places.
[2022-09-20 22:58:14,738 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 162 transitions, 354 flow
[2022-09-20 22:58:14,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:14,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:14,740 INFO  L208   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]
[2022-09-20 22:58:14,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-09-20 22:58:14,740 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:14,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:14,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 157835575, now seen corresponding path program 1 times
[2022-09-20 22:58:14,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:14,741 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275370752]
[2022-09-20 22:58:14,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:14,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:14,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:15,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:15,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:15,584 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275370752]
[2022-09-20 22:58:15,584 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275370752] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 22:58:15,584 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849285749]
[2022-09-20 22:58:15,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:15,584 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:58:15,584 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 22:58:15,586 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-09-20 22:58:15,641 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-09-20 22:58:15,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:15,704 INFO  L263         TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 46 conjunts are in the unsatisfiable core
[2022-09-20 22:58:15,710 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 22:58:16,502 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7
[2022-09-20 22:58:16,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:16,590 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-09-20 22:58:16,829 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:16,829 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 36
[2022-09-20 22:58:17,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:17,574 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849285749] provided 0 perfect and 2 imperfect interpolant sequences
[2022-09-20 22:58:17,575 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-09-20 22:58:17,575 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 19] total 52
[2022-09-20 22:58:17,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201068269]
[2022-09-20 22:58:17,576 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-09-20 22:58:17,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2022-09-20 22:58:17,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:17,578 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2022-09-20 22:58:17,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2253, Unknown=0, NotChecked=0, Total=2652
[2022-09-20 22:58:17,585 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 186
[2022-09-20 22:58:17,590 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 162 transitions, 354 flow. Second operand  has 52 states, 52 states have (on average 102.25) internal successors, (5317), 52 states have internal predecessors, (5317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:17,590 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:17,590 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 186
[2022-09-20 22:58:17,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:20,334 INFO  L130       PetriNetUnfolder]: 2091/4478 cut-off events.
[2022-09-20 22:58:20,334 INFO  L131       PetriNetUnfolder]: For 79/79 co-relation queries the response was YES.
[2022-09-20 22:58:20,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8025 conditions, 4478 events. 2091/4478 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 33905 event pairs, 642 based on Foata normal form. 2/4425 useless extension candidates. Maximal degree in co-relation 7904. Up to 845 conditions per place. 
[2022-09-20 22:58:20,355 INFO  L137   encePairwiseOnDemand]: 143/186 looper letters, 204 selfloop transitions, 72 changer transitions 43/405 dead transitions.
[2022-09-20 22:58:20,355 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 405 transitions, 1528 flow
[2022-09-20 22:58:20,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2022-09-20 22:58:20,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2022-09-20 22:58:20,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4776 transitions.
[2022-09-20 22:58:20,363 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.5706093189964158
[2022-09-20 22:58:20,363 INFO  L72            ComplementDD]: Start complementDD. Operand 45 states and 4776 transitions.
[2022-09-20 22:58:20,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 45 states and 4776 transitions.
[2022-09-20 22:58:20,365 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:20,365 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4776 transitions.
[2022-09-20 22:58:20,372 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 46 states, 45 states have (on average 106.13333333333334) internal successors, (4776), 45 states have internal predecessors, (4776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:20,380 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 46 states, 46 states have (on average 186.0) internal successors, (8556), 46 states have internal predecessors, (8556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:20,382 INFO  L81            ComplementDD]: Finished complementDD. Result  has 46 states, 46 states have (on average 186.0) internal successors, (8556), 46 states have internal predecessors, (8556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:20,382 INFO  L175             Difference]: Start difference. First operand has 182 places, 162 transitions, 354 flow. Second operand 45 states and 4776 transitions.
[2022-09-20 22:58:20,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 405 transitions, 1528 flow
[2022-09-20 22:58:20,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 405 transitions, 1506 flow, removed 6 selfloop flow, removed 7 redundant places.
[2022-09-20 22:58:20,389 INFO  L231             Difference]: Finished difference. Result has 242 places, 228 transitions, 850 flow
[2022-09-20 22:58:20,389 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=850, PETRI_PLACES=242, PETRI_TRANSITIONS=228}
[2022-09-20 22:58:20,390 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 67 predicate places.
[2022-09-20 22:58:20,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 228 transitions, 850 flow
[2022-09-20 22:58:20,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 52 states, 52 states have (on average 102.25) internal successors, (5317), 52 states have internal predecessors, (5317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:20,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:20,392 INFO  L208   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]
[2022-09-20 22:58:20,456 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-09-20 22:58:20,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:58:20,606 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:20,606 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:20,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 1110575003, now seen corresponding path program 2 times
[2022-09-20 22:58:20,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:20,606 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569261139]
[2022-09-20 22:58:20,606 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:20,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:20,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:20,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-09-20 22:58:20,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:20,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569261139]
[2022-09-20 22:58:20,740 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569261139] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 22:58:20,740 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-09-20 22:58:20,741 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-09-20 22:58:20,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032676193]
[2022-09-20 22:58:20,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 22:58:20,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-09-20 22:58:20,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:20,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-09-20 22:58:20,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-09-20 22:58:20,744 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 186
[2022-09-20 22:58:20,744 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 228 transitions, 850 flow. Second operand  has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:20,745 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:20,745 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 186
[2022-09-20 22:58:20,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:22,613 INFO  L130       PetriNetUnfolder]: 4991/10864 cut-off events.
[2022-09-20 22:58:22,613 INFO  L131       PetriNetUnfolder]: For 17528/18046 co-relation queries the response was YES.
[2022-09-20 22:58:22,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30173 conditions, 10864 events. 4991/10864 cut-off events. For 17528/18046 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 100831 event pairs, 1735 based on Foata normal form. 178/10683 useless extension candidates. Maximal degree in co-relation 30117. Up to 2564 conditions per place. 
[2022-09-20 22:58:22,793 INFO  L137   encePairwiseOnDemand]: 176/186 looper letters, 272 selfloop transitions, 18 changer transitions 2/449 dead transitions.
[2022-09-20 22:58:22,793 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 449 transitions, 2563 flow
[2022-09-20 22:58:22,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-09-20 22:58:22,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-09-20 22:58:22,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1444 transitions.
[2022-09-20 22:58:22,796 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.8626045400238949
[2022-09-20 22:58:22,796 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1444 transitions.
[2022-09-20 22:58:22,797 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1444 transitions.
[2022-09-20 22:58:22,797 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:22,797 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1444 transitions.
[2022-09-20 22:58:22,799 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 160.44444444444446) internal successors, (1444), 9 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:22,801 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:22,802 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:22,802 INFO  L175             Difference]: Start difference. First operand has 242 places, 228 transitions, 850 flow. Second operand 9 states and 1444 transitions.
[2022-09-20 22:58:22,802 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 449 transitions, 2563 flow
[2022-09-20 22:58:22,848 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 449 transitions, 2515 flow, removed 16 selfloop flow, removed 14 redundant places.
[2022-09-20 22:58:22,853 INFO  L231             Difference]: Finished difference. Result has 235 places, 242 transitions, 916 flow
[2022-09-20 22:58:22,854 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=916, PETRI_PLACES=235, PETRI_TRANSITIONS=242}
[2022-09-20 22:58:22,855 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 60 predicate places.
[2022-09-20 22:58:22,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 242 transitions, 916 flow
[2022-09-20 22:58:22,859 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:22,859 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:22,859 INFO  L208   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]
[2022-09-20 22:58:22,859 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-09-20 22:58:22,859 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:22,860 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:22,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 1642589437, now seen corresponding path program 3 times
[2022-09-20 22:58:22,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:22,860 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523400021]
[2022-09-20 22:58:22,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:22,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:22,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:22,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-09-20 22:58:22,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:22,955 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523400021]
[2022-09-20 22:58:22,955 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523400021] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 22:58:22,955 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-09-20 22:58:22,955 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-09-20 22:58:22,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264950185]
[2022-09-20 22:58:22,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 22:58:22,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-09-20 22:58:22,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:22,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-09-20 22:58:22,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-09-20 22:58:22,957 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 186
[2022-09-20 22:58:22,958 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 242 transitions, 916 flow. Second operand  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:22,958 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:22,958 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 186
[2022-09-20 22:58:22,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:23,961 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([576] thread2EXIT-->L157-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0))  InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  AuxVars[]  AssignedVars[][245], [60#L157-2true, 154#L123true, 239#(and (< 0 (+ ~j~0 1)) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1343#(= ~tmp1~0 0), Black: 1342#(= ~n2~0 0), Black: 1351#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1357#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 203#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1282#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1268#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1286#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1290#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ ~j~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1262#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1250#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1248#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1252#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1288#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1294#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1246#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1284#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1280#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (+ (* ~j~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ ~i~0 1) ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1278#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1274#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1270#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1264#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (= ~j~0 ~i~0))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= ~j~0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1276#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), 1364#true, Black: 1272#(and (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~i~0 0) (<= 0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (and (<= ~i~0 0) (<= 0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (or (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1266#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1258#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1242#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1348#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1256#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1254#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1240#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))])
[2022-09-20 22:58:23,962 INFO  L383   tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event
[2022-09-20 22:58:23,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2022-09-20 22:58:23,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2022-09-20 22:58:23,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2022-09-20 22:58:23,968 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([576] thread2EXIT-->L157-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0))  InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  AuxVars[]  AssignedVars[][245], [60#L157-2true, 239#(and (< 0 (+ ~j~0 1)) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1343#(= ~tmp1~0 0), Black: 1342#(= ~n2~0 0), Black: 1351#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1357#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 203#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1282#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1268#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 142#L126true, Black: 1286#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1290#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ ~j~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1262#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1250#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1248#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1252#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1288#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1294#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1246#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1284#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1280#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (+ (* ~j~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ ~i~0 1) ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1278#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1274#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1270#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1264#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (= ~j~0 ~i~0))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= ~j~0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1276#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), 1364#true, Black: 1272#(and (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~i~0 0) (<= 0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (and (<= ~i~0 0) (<= 0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (or (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1266#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1258#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1242#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1348#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1256#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1254#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1240#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))])
[2022-09-20 22:58:23,969 INFO  L383   tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event
[2022-09-20 22:58:23,969 INFO  L386   tUnfolder$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2022-09-20 22:58:23,969 INFO  L386   tUnfolder$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2022-09-20 22:58:23,969 INFO  L386   tUnfolder$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2022-09-20 22:58:23,995 INFO  L130       PetriNetUnfolder]: 2958/7561 cut-off events.
[2022-09-20 22:58:23,995 INFO  L131       PetriNetUnfolder]: For 12644/12931 co-relation queries the response was YES.
[2022-09-20 22:58:24,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21382 conditions, 7561 events. 2958/7561 cut-off events. For 12644/12931 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 73688 event pairs, 1531 based on Foata normal form. 45/7197 useless extension candidates. Maximal degree in co-relation 15960. Up to 4453 conditions per place. 
[2022-09-20 22:58:24,059 INFO  L137   encePairwiseOnDemand]: 183/186 looper letters, 75 selfloop transitions, 2 changer transitions 0/258 dead transitions.
[2022-09-20 22:58:24,059 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 258 transitions, 1151 flow
[2022-09-20 22:58:24,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-09-20 22:58:24,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-09-20 22:58:24,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2022-09-20 22:58:24,061 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.9032258064516129
[2022-09-20 22:58:24,061 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2022-09-20 22:58:24,061 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2022-09-20 22:58:24,061 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:24,061 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2022-09-20 22:58:24,062 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:24,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:24,063 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:24,063 INFO  L175             Difference]: Start difference. First operand has 235 places, 242 transitions, 916 flow. Second operand 3 states and 504 transitions.
[2022-09-20 22:58:24,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 258 transitions, 1151 flow
[2022-09-20 22:58:24,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 258 transitions, 1151 flow, removed 0 selfloop flow, removed 0 redundant places.
[2022-09-20 22:58:24,094 INFO  L231             Difference]: Finished difference. Result has 238 places, 242 transitions, 926 flow
[2022-09-20 22:58:24,095 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=238, PETRI_TRANSITIONS=242}
[2022-09-20 22:58:24,096 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 63 predicate places.
[2022-09-20 22:58:24,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 242 transitions, 926 flow
[2022-09-20 22:58:24,096 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:24,097 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:24,097 INFO  L208   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]
[2022-09-20 22:58:24,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-09-20 22:58:24,097 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:24,097 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:24,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -325665905, now seen corresponding path program 4 times
[2022-09-20 22:58:24,098 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:24,098 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125819651]
[2022-09-20 22:58:24,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:24,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:24,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:24,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-09-20 22:58:24,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:24,176 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125819651]
[2022-09-20 22:58:24,177 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125819651] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 22:58:24,177 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-09-20 22:58:24,177 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-09-20 22:58:24,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842037168]
[2022-09-20 22:58:24,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 22:58:24,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-09-20 22:58:24,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:24,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-09-20 22:58:24,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-09-20 22:58:24,179 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 186
[2022-09-20 22:58:24,179 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 242 transitions, 926 flow. Second operand  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:24,179 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:24,179 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 186
[2022-09-20 22:58:24,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:25,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([576] thread2EXIT-->L157-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0))  InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  AuxVars[]  AssignedVars[][252], [60#L157-2true, 154#L123true, 239#(and (< 0 (+ ~j~0 1)) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1343#(= ~tmp1~0 0), Black: 1342#(= ~n2~0 0), Black: 1351#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1357#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 203#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1366#(= (+ (- 1) ~e1~0) 0), Black: 1282#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1268#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1286#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1290#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ ~j~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1262#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1250#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1248#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1252#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1288#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1294#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1246#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1284#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1280#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (+ (* ~j~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ ~i~0 1) ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1278#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1274#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1270#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1264#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (= ~j~0 ~i~0))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= ~j~0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1276#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), 1364#true, Black: 1272#(and (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~i~0 0) (<= 0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (and (<= ~i~0 0) (<= 0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (or (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1369#true, Black: 1266#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1258#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1242#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1348#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1256#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1254#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1240#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))])
[2022-09-20 22:58:25,308 INFO  L383   tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event
[2022-09-20 22:58:25,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2022-09-20 22:58:25,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2022-09-20 22:58:25,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 147 ancestors and is cut-off event
[2022-09-20 22:58:25,313 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([576] thread2EXIT-->L157-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0))  InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4}  AuxVars[]  AssignedVars[][252], [60#L157-2true, 239#(and (< 0 (+ ~j~0 1)) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1343#(= ~tmp1~0 0), Black: 1342#(= ~n2~0 0), Black: 1351#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1357#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 203#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1366#(= (+ (- 1) ~e1~0) 0), Black: 1282#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1268#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1286#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 142#L126true, Black: 1290#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ ~j~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~j~0 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1262#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1250#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1248#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1252#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1288#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1294#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1246#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1284#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_32 Int)) (and (<= (+ v_~j~0_32 1) ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_32 4) ~f~0.offset)) ~j~0) (<= 0 v_~j~0_32))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1280#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (+ (* ~j~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ ~i~0 1) ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1278#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1274#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1270#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1264#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (= ~j~0 ~i~0))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= ~j~0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~j~0 ~i~0)) (and (not (= ~j~0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1276#(and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= 0 ~j~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), 1364#true, Black: 1272#(and (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~i~0 0) (<= 0 ~i~0))) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (or (and (<= ~i~0 0) (<= 0 ~i~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (and (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (or (and (<= (+ ~j~0 1) ~n~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0)))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1369#true, Black: 1266#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1258#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1242#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1348#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1256#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1254#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1240#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))])
[2022-09-20 22:58:25,313 INFO  L383   tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event
[2022-09-20 22:58:25,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2022-09-20 22:58:25,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2022-09-20 22:58:25,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2022-09-20 22:58:25,332 INFO  L130       PetriNetUnfolder]: 3172/7884 cut-off events.
[2022-09-20 22:58:25,333 INFO  L131       PetriNetUnfolder]: For 13680/13956 co-relation queries the response was YES.
[2022-09-20 22:58:25,369 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23212 conditions, 7884 events. 3172/7884 cut-off events. For 13680/13956 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 75688 event pairs, 1776 based on Foata normal form. 77/7499 useless extension candidates. Maximal degree in co-relation 17061. Up to 4646 conditions per place. 
[2022-09-20 22:58:25,398 INFO  L137   encePairwiseOnDemand]: 183/186 looper letters, 81 selfloop transitions, 2 changer transitions 1/265 dead transitions.
[2022-09-20 22:58:25,398 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 265 transitions, 1221 flow
[2022-09-20 22:58:25,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-09-20 22:58:25,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-09-20 22:58:25,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2022-09-20 22:58:25,400 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.9032258064516129
[2022-09-20 22:58:25,400 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2022-09-20 22:58:25,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2022-09-20 22:58:25,400 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:25,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2022-09-20 22:58:25,401 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:25,402 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:25,402 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:25,402 INFO  L175             Difference]: Start difference. First operand has 238 places, 242 transitions, 926 flow. Second operand 3 states and 504 transitions.
[2022-09-20 22:58:25,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 265 transitions, 1221 flow
[2022-09-20 22:58:25,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 265 transitions, 1217 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-09-20 22:58:25,446 INFO  L231             Difference]: Finished difference. Result has 239 places, 242 transitions, 930 flow
[2022-09-20 22:58:25,446 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=239, PETRI_TRANSITIONS=242}
[2022-09-20 22:58:25,448 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 64 predicate places.
[2022-09-20 22:58:25,448 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 242 transitions, 930 flow
[2022-09-20 22:58:25,449 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:25,449 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:25,449 INFO  L208   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]
[2022-09-20 22:58:25,449 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-09-20 22:58:25,449 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:25,449 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:25,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -427110103, now seen corresponding path program 5 times
[2022-09-20 22:58:25,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:25,450 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083238725]
[2022-09-20 22:58:25,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:25,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:25,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:25,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:25,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:25,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083238725]
[2022-09-20 22:58:25,905 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083238725] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 22:58:25,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413127745]
[2022-09-20 22:58:25,905 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-09-20 22:58:25,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:58:25,905 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 22:58:25,907 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-09-20 22:58:25,909 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-09-20 22:58:26,006 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-09-20 22:58:26,007 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-09-20 22:58:26,009 INFO  L263         TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 48 conjunts are in the unsatisfiable core
[2022-09-20 22:58:26,019 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 22:58:26,909 INFO  L356             Elim1Store]: treesize reduction 9, result has 25.0 percent of original size
[2022-09-20 22:58:26,909 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20
[2022-09-20 22:58:26,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:26,977 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-09-20 22:58:27,046 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:27,046 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30
[2022-09-20 22:58:27,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:27,939 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413127745] provided 0 perfect and 2 imperfect interpolant sequences
[2022-09-20 22:58:27,939 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-09-20 22:58:27,940 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 23] total 56
[2022-09-20 22:58:27,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847056265]
[2022-09-20 22:58:27,940 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-09-20 22:58:27,940 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 56 states
[2022-09-20 22:58:27,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:27,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2022-09-20 22:58:27,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2670, Unknown=0, NotChecked=0, Total=3080
[2022-09-20 22:58:27,944 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 186
[2022-09-20 22:58:27,948 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 242 transitions, 930 flow. Second operand  has 56 states, 56 states have (on average 102.28571428571429) internal successors, (5728), 56 states have internal predecessors, (5728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:27,948 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:27,948 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 186
[2022-09-20 22:58:27,948 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:35,765 INFO  L130       PetriNetUnfolder]: 9658/21275 cut-off events.
[2022-09-20 22:58:35,766 INFO  L131       PetriNetUnfolder]: For 41383/42328 co-relation queries the response was YES.
[2022-09-20 22:58:35,883 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67191 conditions, 21275 events. 9658/21275 cut-off events. For 41383/42328 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 220691 event pairs, 756 based on Foata normal form. 336/21268 useless extension candidates. Maximal degree in co-relation 58278. Up to 7052 conditions per place. 
[2022-09-20 22:58:35,950 INFO  L137   encePairwiseOnDemand]: 134/186 looper letters, 385 selfloop transitions, 355 changer transitions 136/976 dead transitions.
[2022-09-20 22:58:35,950 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 976 transitions, 6909 flow
[2022-09-20 22:58:35,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. 
[2022-09-20 22:58:35,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2022-09-20 22:58:35,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 9423 transitions.
[2022-09-20 22:58:35,965 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.5692279811525915
[2022-09-20 22:58:35,965 INFO  L72            ComplementDD]: Start complementDD. Operand 89 states and 9423 transitions.
[2022-09-20 22:58:35,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 89 states and 9423 transitions.
[2022-09-20 22:58:35,969 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:35,969 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 9423 transitions.
[2022-09-20 22:58:35,986 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 90 states, 89 states have (on average 105.87640449438203) internal successors, (9423), 89 states have internal predecessors, (9423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:36,013 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 90 states, 90 states have (on average 186.0) internal successors, (16740), 90 states have internal predecessors, (16740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:36,017 INFO  L81            ComplementDD]: Finished complementDD. Result  has 90 states, 90 states have (on average 186.0) internal successors, (16740), 90 states have internal predecessors, (16740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:36,017 INFO  L175             Difference]: Start difference. First operand has 239 places, 242 transitions, 930 flow. Second operand 89 states and 9423 transitions.
[2022-09-20 22:58:36,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 976 transitions, 6909 flow
[2022-09-20 22:58:36,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 976 transitions, 6905 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-09-20 22:58:36,160 INFO  L231             Difference]: Finished difference. Result has 367 places, 572 transitions, 4354 flow
[2022-09-20 22:58:36,160 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=4354, PETRI_PLACES=367, PETRI_TRANSITIONS=572}
[2022-09-20 22:58:36,162 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 192 predicate places.
[2022-09-20 22:58:36,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 367 places, 572 transitions, 4354 flow
[2022-09-20 22:58:36,165 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 56 states, 56 states have (on average 102.28571428571429) internal successors, (5728), 56 states have internal predecessors, (5728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:36,165 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:36,165 INFO  L208   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]
[2022-09-20 22:58:36,184 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2022-09-20 22:58:36,379 WARN  L477      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-09-20 22:58:36,380 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:36,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:36,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -117583183, now seen corresponding path program 6 times
[2022-09-20 22:58:36,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:36,380 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944623017]
[2022-09-20 22:58:36,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:36,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:36,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:36,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:36,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:36,709 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944623017]
[2022-09-20 22:58:36,709 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944623017] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 22:58:36,709 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38329160]
[2022-09-20 22:58:36,709 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-09-20 22:58:36,709 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:58:36,710 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 22:58:36,724 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-09-20 22:58:36,725 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-09-20 22:58:36,810 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2022-09-20 22:58:36,810 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-09-20 22:58:36,812 INFO  L263         TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-09-20 22:58:36,814 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 22:58:37,025 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:37,025 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26
[2022-09-20 22:58:37,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-09-20 22:58:37,042 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-09-20 22:58:37,042 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [38329160] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 22:58:37,042 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-09-20 22:58:37,042 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21] total 28
[2022-09-20 22:58:37,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721700871]
[2022-09-20 22:58:37,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 22:58:37,043 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-09-20 22:58:37,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:37,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-09-20 22:58:37,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756
[2022-09-20 22:58:37,044 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 186
[2022-09-20 22:58:37,045 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 572 transitions, 4354 flow. Second operand  has 12 states, 12 states have (on average 120.83333333333333) internal successors, (1450), 12 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:37,045 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:37,045 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 186
[2022-09-20 22:58:37,045 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:58:43,962 INFO  L130       PetriNetUnfolder]: 10849/25123 cut-off events.
[2022-09-20 22:58:43,962 INFO  L131       PetriNetUnfolder]: For 432535/434742 co-relation queries the response was YES.
[2022-09-20 22:58:44,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139219 conditions, 25123 events. 10849/25123 cut-off events. For 432535/434742 co-relation queries the response was YES. Maximal size of possible extension queue 1539. Compared 279095 event pairs, 1346 based on Foata normal form. 610/25270 useless extension candidates. Maximal degree in co-relation 139114. Up to 12238 conditions per place. 
[2022-09-20 22:58:44,493 INFO  L137   encePairwiseOnDemand]: 169/186 looper letters, 560 selfloop transitions, 108 changer transitions 9/804 dead transitions.
[2022-09-20 22:58:44,493 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 804 transitions, 8158 flow
[2022-09-20 22:58:44,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-09-20 22:58:44,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2022-09-20 22:58:44,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1892 transitions.
[2022-09-20 22:58:44,495 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.6781362007168459
[2022-09-20 22:58:44,496 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1892 transitions.
[2022-09-20 22:58:44,496 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1892 transitions.
[2022-09-20 22:58:44,496 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:58:44,496 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1892 transitions.
[2022-09-20 22:58:44,498 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 126.13333333333334) internal successors, (1892), 15 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:44,500 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 186.0) internal successors, (2976), 16 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:44,500 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 186.0) internal successors, (2976), 16 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:44,501 INFO  L175             Difference]: Start difference. First operand has 367 places, 572 transitions, 4354 flow. Second operand 15 states and 1892 transitions.
[2022-09-20 22:58:44,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 804 transitions, 8158 flow
[2022-09-20 22:58:49,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 804 transitions, 7590 flow, removed 254 selfloop flow, removed 34 redundant places.
[2022-09-20 22:58:49,535 INFO  L231             Difference]: Finished difference. Result has 349 places, 634 transitions, 4787 flow
[2022-09-20 22:58:49,536 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4787, PETRI_PLACES=349, PETRI_TRANSITIONS=634}
[2022-09-20 22:58:49,536 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 174 predicate places.
[2022-09-20 22:58:49,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 634 transitions, 4787 flow
[2022-09-20 22:58:49,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 120.83333333333333) internal successors, (1450), 12 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:49,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:58:49,537 INFO  L208   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]
[2022-09-20 22:58:49,556 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-09-20 22:58:49,754 WARN  L477      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-09-20 22:58:49,754 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:58:49,755 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:58:49,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -1636018993, now seen corresponding path program 7 times
[2022-09-20 22:58:49,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:58:49,755 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613236306]
[2022-09-20 22:58:49,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:58:49,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:58:49,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:50,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:50,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:58:50,024 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613236306]
[2022-09-20 22:58:50,024 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613236306] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 22:58:50,024 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470277944]
[2022-09-20 22:58:50,024 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2022-09-20 22:58:50,024 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:58:50,024 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 22:58:50,040 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-09-20 22:58:50,042 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-09-20 22:58:50,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:58:50,129 INFO  L263         TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 64 conjunts are in the unsatisfiable core
[2022-09-20 22:58:50,133 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 22:58:50,152 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-09-20 22:58:50,187 INFO  L356             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2022-09-20 22:58:50,187 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2022-09-20 22:58:50,429 INFO  L356             Elim1Store]: treesize reduction 16, result has 36.0 percent of original size
[2022-09-20 22:58:50,429 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18
[2022-09-20 22:58:50,534 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-09-20 22:58:51,107 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-09-20 22:58:51,171 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-09-20 22:58:51,211 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-09-20 22:58:51,481 INFO  L356             Elim1Store]: treesize reduction 9, result has 25.0 percent of original size
[2022-09-20 22:58:51,482 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20
[2022-09-20 22:58:51,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:51,527 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-09-20 22:58:54,920 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:54,921 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 92
[2022-09-20 22:58:54,930 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:54,930 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1024 treesize of output 980
[2022-09-20 22:58:54,948 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:54,949 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 566 treesize of output 448
[2022-09-20 22:58:54,966 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:54,966 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 984 treesize of output 722
[2022-09-20 22:58:54,986 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:58:54,986 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 696 treesize of output 650
[2022-09-20 22:58:54,996 INFO  L208   tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug.
[2022-09-20 22:58:57,800 INFO  L356             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2022-09-20 22:58:57,800 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 1
[2022-09-20 22:58:58,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:58:58,173 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470277944] provided 0 perfect and 2 imperfect interpolant sequences
[2022-09-20 22:58:58,173 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-09-20 22:58:58,173 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 31, 28] total 71
[2022-09-20 22:58:58,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992405799]
[2022-09-20 22:58:58,173 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-09-20 22:58:58,173 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 71 states
[2022-09-20 22:58:58,173 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:58:58,174 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2022-09-20 22:58:58,175 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4343, Unknown=114, NotChecked=0, Total=4970
[2022-09-20 22:58:58,177 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 186
[2022-09-20 22:58:58,180 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 634 transitions, 4787 flow. Second operand  has 71 states, 71 states have (on average 88.91549295774648) internal successors, (6313), 71 states have internal predecessors, (6313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:58:58,181 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:58:58,181 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 186
[2022-09-20 22:58:58,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:59:14,547 INFO  L130       PetriNetUnfolder]: 14960/36419 cut-off events.
[2022-09-20 22:59:14,547 INFO  L131       PetriNetUnfolder]: For 644713/647440 co-relation queries the response was YES.
[2022-09-20 22:59:15,427 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 204279 conditions, 36419 events. 14960/36419 cut-off events. For 644713/647440 co-relation queries the response was YES. Maximal size of possible extension queue 2205. Compared 442418 event pairs, 1842 based on Foata normal form. 1321/37144 useless extension candidates. Maximal degree in co-relation 204175. Up to 7679 conditions per place. 
[2022-09-20 22:59:15,648 INFO  L137   encePairwiseOnDemand]: 142/186 looper letters, 570 selfloop transitions, 725 changer transitions 192/1580 dead transitions.
[2022-09-20 22:59:15,648 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 1580 transitions, 19016 flow
[2022-09-20 22:59:15,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. 
[2022-09-20 22:59:15,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2022-09-20 22:59:15,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 7283 transitions.
[2022-09-20 22:59:15,657 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.5019988971601875
[2022-09-20 22:59:15,658 INFO  L72            ComplementDD]: Start complementDD. Operand 78 states and 7283 transitions.
[2022-09-20 22:59:15,658 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 78 states and 7283 transitions.
[2022-09-20 22:59:15,660 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:59:15,660 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 7283 transitions.
[2022-09-20 22:59:15,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 79 states, 78 states have (on average 93.37179487179488) internal successors, (7283), 78 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:15,686 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 79 states, 79 states have (on average 186.0) internal successors, (14694), 79 states have internal predecessors, (14694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:15,690 INFO  L81            ComplementDD]: Finished complementDD. Result  has 79 states, 79 states have (on average 186.0) internal successors, (14694), 79 states have internal predecessors, (14694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:15,690 INFO  L175             Difference]: Start difference. First operand has 349 places, 634 transitions, 4787 flow. Second operand 78 states and 7283 transitions.
[2022-09-20 22:59:15,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 1580 transitions, 19016 flow
[2022-09-20 22:59:24,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1580 transitions, 18964 flow, removed 18 selfloop flow, removed 6 redundant places.
[2022-09-20 22:59:24,085 INFO  L231             Difference]: Finished difference. Result has 448 places, 1063 transitions, 11582 flow
[2022-09-20 22:59:24,086 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=4747, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=11582, PETRI_PLACES=448, PETRI_TRANSITIONS=1063}
[2022-09-20 22:59:24,087 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 273 predicate places.
[2022-09-20 22:59:24,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 448 places, 1063 transitions, 11582 flow
[2022-09-20 22:59:24,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 71 states, 71 states have (on average 88.91549295774648) internal successors, (6313), 71 states have internal predecessors, (6313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:24,111 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 22:59:24,111 INFO  L208   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]
[2022-09-20 22:59:24,133 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-09-20 22:59:24,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:59:24,332 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 22:59:24,332 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 22:59:24,332 INFO  L85        PathProgramCache]: Analyzing trace with hash -932559411, now seen corresponding path program 8 times
[2022-09-20 22:59:24,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 22:59:24,333 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902471159]
[2022-09-20 22:59:24,333 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 22:59:24,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 22:59:24,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 22:59:24,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 22:59:24,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 22:59:24,700 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902471159]
[2022-09-20 22:59:24,701 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902471159] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 22:59:24,701 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903344235]
[2022-09-20 22:59:24,701 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-09-20 22:59:24,701 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 22:59:24,701 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 22:59:24,702 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-09-20 22:59:24,703 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-09-20 22:59:24,793 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-09-20 22:59:24,793 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-09-20 22:59:24,794 INFO  L263         TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-09-20 22:59:24,796 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 22:59:25,031 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 22:59:25,032 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26
[2022-09-20 22:59:25,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-09-20 22:59:25,041 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-09-20 22:59:25,041 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903344235] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 22:59:25,041 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-09-20 22:59:25,041 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21] total 28
[2022-09-20 22:59:25,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326885873]
[2022-09-20 22:59:25,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 22:59:25,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-09-20 22:59:25,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 22:59:25,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-09-20 22:59:25,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756
[2022-09-20 22:59:25,043 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 186
[2022-09-20 22:59:25,044 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 1063 transitions, 11582 flow. Second operand  has 12 states, 12 states have (on average 120.83333333333333) internal successors, (1450), 12 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:25,044 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 22:59:25,044 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 186
[2022-09-20 22:59:25,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 22:59:39,059 INFO  L130       PetriNetUnfolder]: 14752/36937 cut-off events.
[2022-09-20 22:59:39,060 INFO  L131       PetriNetUnfolder]: For 1174888/1179994 co-relation queries the response was YES.
[2022-09-20 22:59:40,071 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 257725 conditions, 36937 events. 14752/36937 cut-off events. For 1174888/1179994 co-relation queries the response was YES. Maximal size of possible extension queue 2229. Compared 457479 event pairs, 1790 based on Foata normal form. 1349/37549 useless extension candidates. Maximal degree in co-relation 257588. Up to 19008 conditions per place. 
[2022-09-20 22:59:40,311 INFO  L137   encePairwiseOnDemand]: 165/186 looper letters, 948 selfloop transitions, 190 changer transitions 33/1298 dead transitions.
[2022-09-20 22:59:40,311 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1298 transitions, 17509 flow
[2022-09-20 22:59:40,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-09-20 22:59:40,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2022-09-20 22:59:40,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2016 transitions.
[2022-09-20 22:59:40,320 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.6774193548387096
[2022-09-20 22:59:40,320 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 2016 transitions.
[2022-09-20 22:59:40,320 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 2016 transitions.
[2022-09-20 22:59:40,322 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 22:59:40,322 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2016 transitions.
[2022-09-20 22:59:40,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 126.0) internal successors, (2016), 16 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:40,333 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 186.0) internal successors, (3162), 17 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:40,333 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 186.0) internal successors, (3162), 17 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 22:59:40,333 INFO  L175             Difference]: Start difference. First operand has 448 places, 1063 transitions, 11582 flow. Second operand 16 states and 2016 transitions.
[2022-09-20 22:59:40,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1298 transitions, 17509 flow
[2022-09-20 23:00:00,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1298 transitions, 16615 flow, removed 417 selfloop flow, removed 28 redundant places.
[2022-09-20 23:00:00,793 INFO  L231             Difference]: Finished difference. Result has 432 places, 1095 transitions, 12008 flow
[2022-09-20 23:00:00,794 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=10873, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12008, PETRI_PLACES=432, PETRI_TRANSITIONS=1095}
[2022-09-20 23:00:00,795 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 257 predicate places.
[2022-09-20 23:00:00,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 432 places, 1095 transitions, 12008 flow
[2022-09-20 23:00:00,795 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 120.83333333333333) internal successors, (1450), 12 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:00,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 23:00:00,795 INFO  L208   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]
[2022-09-20 23:00:00,816 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2022-09-20 23:00:01,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 23:00:01,007 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 23:00:01,007 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 23:00:01,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 869029129, now seen corresponding path program 9 times
[2022-09-20 23:00:01,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 23:00:01,007 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039587457]
[2022-09-20 23:00:01,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 23:00:01,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 23:00:01,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 23:00:02,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 23:00:02,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 23:00:02,167 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039587457]
[2022-09-20 23:00:02,167 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039587457] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 23:00:02,167 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216423981]
[2022-09-20 23:00:02,167 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-09-20 23:00:02,167 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 23:00:02,167 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 23:00:02,168 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-09-20 23:00:02,170 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-09-20 23:00:02,271 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2022-09-20 23:00:02,271 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-09-20 23:00:02,273 INFO  L263         TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-09-20 23:00:02,275 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 23:00:02,575 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 23:00:02,576 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26
[2022-09-20 23:00:02,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-09-20 23:00:02,585 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-09-20 23:00:02,585 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [216423981] provided 1 perfect and 0 imperfect interpolant sequences
[2022-09-20 23:00:02,585 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-09-20 23:00:02,585 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [32] total 40
[2022-09-20 23:00:02,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203815334]
[2022-09-20 23:00:02,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-09-20 23:00:02,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-09-20 23:00:02,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 23:00:02,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-09-20 23:00:02,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560
[2022-09-20 23:00:02,587 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 186
[2022-09-20 23:00:02,588 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1095 transitions, 12008 flow. Second operand  has 12 states, 12 states have (on average 120.83333333333333) internal successors, (1450), 12 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:02,588 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 23:00:02,588 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 186
[2022-09-20 23:00:02,588 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-09-20 23:00:20,175 INFO  L130       PetriNetUnfolder]: 16895/42271 cut-off events.
[2022-09-20 23:00:20,176 INFO  L131       PetriNetUnfolder]: For 1387710/1397489 co-relation queries the response was YES.
[2022-09-20 23:00:21,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305859 conditions, 42271 events. 16895/42271 cut-off events. For 1387710/1397489 co-relation queries the response was YES. Maximal size of possible extension queue 2501. Compared 533350 event pairs, 1946 based on Foata normal form. 1656/43104 useless extension candidates. Maximal degree in co-relation 305725. Up to 22686 conditions per place. 
[2022-09-20 23:00:21,557 INFO  L137   encePairwiseOnDemand]: 163/186 looper letters, 1085 selfloop transitions, 203 changer transitions 33/1448 dead transitions.
[2022-09-20 23:00:21,558 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 1448 transitions, 20097 flow
[2022-09-20 23:00:21,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-09-20 23:00:21,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2022-09-20 23:00:21,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2010 transitions.
[2022-09-20 23:00:21,574 INFO  L522   CegarLoopForPetriNet]: DFA transition density 0.6754032258064516
[2022-09-20 23:00:21,574 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 2010 transitions.
[2022-09-20 23:00:21,574 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 2010 transitions.
[2022-09-20 23:00:21,574 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-09-20 23:00:21,574 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2010 transitions.
[2022-09-20 23:00:21,576 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 125.625) internal successors, (2010), 16 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:21,578 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 186.0) internal successors, (3162), 17 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:21,579 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 186.0) internal successors, (3162), 17 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:21,579 INFO  L175             Difference]: Start difference. First operand has 432 places, 1095 transitions, 12008 flow. Second operand 16 states and 2010 transitions.
[2022-09-20 23:00:21,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 1448 transitions, 20097 flow
[2022-09-20 23:00:44,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 1448 transitions, 19342 flow, removed 138 selfloop flow, removed 13 redundant places.
[2022-09-20 23:00:44,746 INFO  L231             Difference]: Finished difference. Result has 440 places, 1209 transitions, 14224 flow
[2022-09-20 23:00:44,747 INFO  L270   CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=11580, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1095, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=14224, PETRI_PLACES=440, PETRI_TRANSITIONS=1209}
[2022-09-20 23:00:44,748 INFO  L287   CegarLoopForPetriNet]: 175 programPoint places, 265 predicate places.
[2022-09-20 23:00:44,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 440 places, 1209 transitions, 14224 flow
[2022-09-20 23:00:44,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 120.83333333333333) internal successors, (1450), 12 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:44,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2022-09-20 23:00:44,748 INFO  L208   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]
[2022-09-20 23:00:44,769 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-09-20 23:00:44,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 23:00:44,970 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-09-20 23:00:44,970 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-09-20 23:00:44,970 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083818711, now seen corresponding path program 10 times
[2022-09-20 23:00:44,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-09-20 23:00:44,970 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726637116]
[2022-09-20 23:00:44,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-09-20 23:00:44,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-09-20 23:00:45,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-09-20 23:00:45,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 23:00:45,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-09-20 23:00:45,282 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726637116]
[2022-09-20 23:00:45,282 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726637116] provided 0 perfect and 1 imperfect interpolant sequences
[2022-09-20 23:00:45,282 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744242015]
[2022-09-20 23:00:45,282 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-09-20 23:00:45,282 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-09-20 23:00:45,283 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-09-20 23:00:45,283 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-09-20 23:00:45,284 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-09-20 23:00:45,376 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-09-20 23:00:45,376 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-09-20 23:00:45,377 INFO  L263         TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 43 conjunts are in the unsatisfiable core
[2022-09-20 23:00:45,381 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-09-20 23:00:46,000 INFO  L356             Elim1Store]: treesize reduction 13, result has 18.8 percent of original size
[2022-09-20 23:00:46,000 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 13
[2022-09-20 23:00:46,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 23:00:46,051 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-09-20 23:00:46,357 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-09-20 23:00:46,357 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 78
[2022-09-20 23:00:46,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-09-20 23:00:46,796 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744242015] provided 0 perfect and 2 imperfect interpolant sequences
[2022-09-20 23:00:46,796 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-09-20 23:00:46,796 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 47
[2022-09-20 23:00:46,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215203207]
[2022-09-20 23:00:46,796 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-09-20 23:00:46,796 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2022-09-20 23:00:46,796 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-09-20 23:00:46,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2022-09-20 23:00:46,797 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1893, Unknown=0, NotChecked=0, Total=2162
[2022-09-20 23:00:46,799 INFO  L477   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 186
[2022-09-20 23:00:46,801 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 1209 transitions, 14224 flow. Second operand  has 47 states, 47 states have (on average 100.72340425531915) internal successors, (4734), 47 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-09-20 23:00:46,801 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-09-20 23:00:46,801 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 186
[2022-09-20 23:00:46,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand