/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_longest-1_bound2.i


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


This is Ultimate 0.2.3-dev-19404b3-m
[2023-08-04 04:23:30,612 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-08-04 04:23:30,664 INFO  L114        SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf
[2023-08-04 04:23:30,668 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-08-04 04:23:30,668 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-08-04 04:23:30,668 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode:
[2023-08-04 04:23:30,669 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2023-08-04 04:23:30,685 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-04 04:23:30,686 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-04 04:23:30,690 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-04 04:23:30,690 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-04 04:23:30,690 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-04 04:23:30,691 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-04 04:23:30,691 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-08-04 04:23:30,691 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-08-04 04:23:30,691 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-04 04:23:30,691 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-08-04 04:23:30,692 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-08-04 04:23:30,692 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-08-04 04:23:30,692 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-08-04 04:23:30,692 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-08-04 04:23:30,694 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-08-04 04:23:30,694 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-04 04:23:30,695 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-08-04 04:23:30,695 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-08-04 04:23:30,695 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-08-04 04:23:30,695 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-08-04 04:23:30,696 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-04 04:23:30,696 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-08-04 04:23:30,696 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-08-04 04:23:30,697 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-04 04:23:30,697 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-04 04:23:30,697 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-08-04 04:23:30,697 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-04 04:23:30,698 INFO  L153        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-04 04:23:30,699 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST
[2023-08-04 04:23:30,872 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-04 04:23:30,892 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-04 04:23:30,894 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-04 04:23:30,894 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-08-04 04:23:30,895 INFO  L274        PluginConnector]: CDTParser initialized
[2023-08-04 04:23:30,895 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_longest-1_bound2.i
[2023-08-04 04:23:31,801 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-08-04 04:23:32,000 INFO  L384              CDTParser]: Found 1 translation units.
[2023-08-04 04:23:32,000 INFO  L180              CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_longest-1_bound2.i
[2023-08-04 04:23:32,008 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d219eca6/71f0a7ef89f64618bce85e3430175acf/FLAG1df012a83
[2023-08-04 04:23:32,389 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d219eca6/71f0a7ef89f64618bce85e3430175acf
[2023-08-04 04:23:32,391 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-04 04:23:32,392 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-08-04 04:23:32,392 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-04 04:23:32,392 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-04 04:23:32,395 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-04 04:23:32,395 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,396 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cfd9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32, skipping insertion in model container
[2023-08-04 04:23:32,396 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,425 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2023-08-04 04:23:32,611 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_longest-1_bound2.i[31167,31180]
[2023-08-04 04:23:32,621 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-04 04:23:32,633 INFO  L201         MainTranslator]: Completed pre-run
[2023-08-04 04:23:32,660 WARN  L75    lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254]
[2023-08-04 04:23:32,662 WARN  L75    lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254]
[2023-08-04 04:23:32,689 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_longest-1_bound2.i[31167,31180]
[2023-08-04 04:23:32,699 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-04 04:23:32,721 INFO  L206         MainTranslator]: Completed translation
[2023-08-04 04:23:32,721 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32 WrapperNode
[2023-08-04 04:23:32,721 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-04 04:23:32,722 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-04 04:23:32,722 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-04 04:23:32,722 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-04 04:23:32,727 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,739 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,755 INFO  L138                Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 192
[2023-08-04 04:23:32,755 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-04 04:23:32,756 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-04 04:23:32,756 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-04 04:23:32,756 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-08-04 04:23:32,766 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,767 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,769 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,769 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,774 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,776 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,777 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,778 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,780 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-04 04:23:32,781 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-04 04:23:32,781 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-08-04 04:23:32,781 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-08-04 04:23:32,781 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (1/1) ...
[2023-08-04 04:23:32,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-04 04:23:32,806 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-04 04:23:32,817 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)
[2023-08-04 04:23:32,818 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
[2023-08-04 04:23:32,844 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-08-04 04:23:32,844 INFO  L130     BoogieDeclarations]: Found specification of procedure thr1
[2023-08-04 04:23:32,844 INFO  L138     BoogieDeclarations]: Found implementation of procedure thr1
[2023-08-04 04:23:32,844 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-08-04 04:23:32,844 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-04 04:23:32,844 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-04 04:23:32,844 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-04 04:23:32,845 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-04 04:23:32,845 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-04 04:23:32,845 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-04 04:23:32,846 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-04 04:23:32,973 INFO  L236             CfgBuilder]: Building ICFG
[2023-08-04 04:23:32,974 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-04 04:23:33,233 INFO  L277             CfgBuilder]: Performing block encoding
[2023-08-04 04:23:33,355 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-04 04:23:33,355 INFO  L302             CfgBuilder]: Removed 3 assume(true) statements.
[2023-08-04 04:23:33,357 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:23:33 BoogieIcfgContainer
[2023-08-04 04:23:33,357 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-04 04:23:33,359 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-04 04:23:33,359 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-08-04 04:23:33,361 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-08-04 04:23:33,361 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:23:32" (1/3) ...
[2023-08-04 04:23:33,362 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b7e0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:23:33, skipping insertion in model container
[2023-08-04 04:23:33,362 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:32" (2/3) ...
[2023-08-04 04:23:33,363 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b7e0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:23:33, skipping insertion in model container
[2023-08-04 04:23:33,363 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:23:33" (3/3) ...
[2023-08-04 04:23:33,363 INFO  L112   eAbstractionObserver]: Analyzing ICFG pthread-ext_26_stack_cas_longest-1_bound2.i
[2023-08-04 04:23:33,369 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-08-04 04:23:33,374 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-04 04:23:33,375 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-08-04 04:23:33,375 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-04 04:23:33,438 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-04 04:23:33,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 111 places, 118 transitions, 241 flow
[2023-08-04 04:23:33,502 INFO  L124   PetriNetUnfolderBase]: 11/128 cut-off events.
[2023-08-04 04:23:33,502 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-04 04:23:33,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 11/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. 
[2023-08-04 04:23:33,507 INFO  L82        GeneralOperation]: Start removeDead. Operand has 111 places, 118 transitions, 241 flow
[2023-08-04 04:23:33,510 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 111 places, 118 transitions, 241 flow
[2023-08-04 04:23:33,512 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-04 04:23:33,517 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 118 transitions, 241 flow
[2023-08-04 04:23:33,519 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 118 transitions, 241 flow
[2023-08-04 04:23:33,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 111 places, 118 transitions, 241 flow
[2023-08-04 04:23:33,538 INFO  L124   PetriNetUnfolderBase]: 11/128 cut-off events.
[2023-08-04 04:23:33,538 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-04 04:23:33,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 11/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. 
[2023-08-04 04:23:33,540 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2496
[2023-08-04 04:23:36,938 INFO  L134        LiptonReduction]: Checked pairs total: 2969
[2023-08-04 04:23:36,938 INFO  L136        LiptonReduction]: Total number of compositions: 108
[2023-08-04 04:23:36,949 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-04 04:23:36,954 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=true, 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;@4e85f681, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-04 04:23:36,954 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2023-08-04 04:23:36,962 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-08-04 04:23:36,963 INFO  L124   PetriNetUnfolderBase]: 5/25 cut-off events.
[2023-08-04 04:23:36,963 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-04 04:23:36,963 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-04 04:23:36,963 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-04 04:23:36,964 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-08-04 04:23:36,968 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-04 04:23:36,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -938850934, now seen corresponding path program 1 times
[2023-08-04 04:23:36,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-04 04:23:36,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863002706]
[2023-08-04 04:23:36,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-04 04:23:36,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-04 04:23:37,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-04 04:23:37,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-04 04:23:37,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-04 04:23:37,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863002706]
[2023-08-04 04:23:37,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863002706] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-04 04:23:37,185 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-04 04:23:37,185 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-04 04:23:37,186 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614102125]
[2023-08-04 04:23:37,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-04 04:23:37,192 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-04 04:23:37,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-04 04:23:37,207 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-04 04:23:37,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-04 04:23:37,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 226
[2023-08-04 04:23:37,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 28 transitions, 61 flow. Second operand  has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-04 04:23:37,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 226
[2023-08-04 04:23:37,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-04 04:23:37,293 INFO  L124   PetriNetUnfolderBase]: 61/130 cut-off events.
[2023-08-04 04:23:37,293 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-04 04:23:37,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 265 conditions, 130 events. 61/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 321 event pairs, 3 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 248. Up to 115 conditions per place. 
[2023-08-04 04:23:37,295 INFO  L140   encePairwiseOnDemand]: 221/226 looper letters, 24 selfloop transitions, 2 changer transitions 1/28 dead transitions.
[2023-08-04 04:23:37,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 115 flow
[2023-08-04 04:23:37,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-04 04:23:37,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-04 04:23:37,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions.
[2023-08-04 04:23:37,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49557522123893805
[2023-08-04 04:23:37,304 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 336 transitions.
[2023-08-04 04:23:37,305 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions.
[2023-08-04 04:23:37,306 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-04 04:23:37,307 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions.
[2023-08-04 04:23:37,310 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,313 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,313 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,314 INFO  L175             Difference]: Start difference. First operand has 24 places, 28 transitions, 61 flow. Second operand 3 states and 336 transitions.
[2023-08-04 04:23:37,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 115 flow
[2023-08-04 04:23:37,316 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 115 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-04 04:23:37,317 INFO  L231             Difference]: Finished difference. Result has 26 places, 24 transitions, 57 flow
[2023-08-04 04:23:37,318 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=26, PETRI_TRANSITIONS=24}
[2023-08-04 04:23:37,320 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places.
[2023-08-04 04:23:37,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 57 flow
[2023-08-04 04:23:37,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-04 04:23:37,321 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-04 04:23:37,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-04 04:23:37,321 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-08-04 04:23:37,321 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-04 04:23:37,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -491700112, now seen corresponding path program 1 times
[2023-08-04 04:23:37,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-04 04:23:37,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222477383]
[2023-08-04 04:23:37,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-04 04:23:37,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-04 04:23:37,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-04 04:23:37,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-04 04:23:37,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-04 04:23:37,410 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222477383]
[2023-08-04 04:23:37,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222477383] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-04 04:23:37,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-04 04:23:37,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-04 04:23:37,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132702790]
[2023-08-04 04:23:37,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-04 04:23:37,412 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-04 04:23:37,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-04 04:23:37,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-04 04:23:37,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-04 04:23:37,417 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226
[2023-08-04 04:23:37,418 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 57 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,418 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-04 04:23:37,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226
[2023-08-04 04:23:37,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-04 04:23:37,471 INFO  L124   PetriNetUnfolderBase]: 73/158 cut-off events.
[2023-08-04 04:23:37,472 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2023-08-04 04:23:37,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 327 conditions, 158 events. 73/158 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 425 event pairs, 21 based on Foata normal form. 4/121 useless extension candidates. Maximal degree in co-relation 308. Up to 101 conditions per place. 
[2023-08-04 04:23:37,476 INFO  L140   encePairwiseOnDemand]: 223/226 looper letters, 28 selfloop transitions, 2 changer transitions 1/32 dead transitions.
[2023-08-04 04:23:37,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 135 flow
[2023-08-04 04:23:37,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-04 04:23:37,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-04 04:23:37,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2023-08-04 04:23:37,481 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4941002949852507
[2023-08-04 04:23:37,481 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2023-08-04 04:23:37,481 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2023-08-04 04:23:37,482 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-04 04:23:37,482 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2023-08-04 04:23:37,483 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,485 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,486 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,486 INFO  L175             Difference]: Start difference. First operand has 26 places, 24 transitions, 57 flow. Second operand 3 states and 335 transitions.
[2023-08-04 04:23:37,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 135 flow
[2023-08-04 04:23:37,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-04 04:23:37,487 INFO  L231             Difference]: Finished difference. Result has 26 places, 25 transitions, 65 flow
[2023-08-04 04:23:37,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=26, PETRI_TRANSITIONS=25}
[2023-08-04 04:23:37,488 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places.
[2023-08-04 04:23:37,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 65 flow
[2023-08-04 04:23:37,491 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,492 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-04 04:23:37,505 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-04 04:23:37,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-04 04:23:37,505 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-08-04 04:23:37,505 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-04 04:23:37,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -488589355, now seen corresponding path program 1 times
[2023-08-04 04:23:37,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-04 04:23:37,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120979116]
[2023-08-04 04:23:37,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-04 04:23:37,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-04 04:23:37,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-04 04:23:37,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-04 04:23:37,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-04 04:23:37,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120979116]
[2023-08-04 04:23:37,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120979116] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-04 04:23:37,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-04 04:23:37,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-04 04:23:37,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523525772]
[2023-08-04 04:23:37,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-04 04:23:37,601 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-04 04:23:37,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-04 04:23:37,601 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-04 04:23:37,601 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-04 04:23:37,629 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226
[2023-08-04 04:23:37,629 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 65 flow. Second operand  has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,629 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-04 04:23:37,629 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226
[2023-08-04 04:23:37,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-04 04:23:37,720 INFO  L124   PetriNetUnfolderBase]: 104/225 cut-off events.
[2023-08-04 04:23:37,721 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-04 04:23:37,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 474 conditions, 225 events. 104/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 569 event pairs, 18 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 454. Up to 101 conditions per place. 
[2023-08-04 04:23:37,723 INFO  L140   encePairwiseOnDemand]: 220/226 looper letters, 44 selfloop transitions, 5 changer transitions 1/51 dead transitions.
[2023-08-04 04:23:37,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 51 transitions, 217 flow
[2023-08-04 04:23:37,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-08-04 04:23:37,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-04 04:23:37,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions.
[2023-08-04 04:23:37,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45353982300884954
[2023-08-04 04:23:37,725 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 615 transitions.
[2023-08-04 04:23:37,725 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions.
[2023-08-04 04:23:37,725 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-04 04:23:37,726 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions.
[2023-08-04 04:23:37,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,729 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,729 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,729 INFO  L175             Difference]: Start difference. First operand has 26 places, 25 transitions, 65 flow. Second operand 6 states and 615 transitions.
[2023-08-04 04:23:37,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 51 transitions, 217 flow
[2023-08-04 04:23:37,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 51 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-04 04:23:37,731 INFO  L231             Difference]: Finished difference. Result has 33 places, 28 transitions, 93 flow
[2023-08-04 04:23:37,731 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=28}
[2023-08-04 04:23:37,732 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places.
[2023-08-04 04:23:37,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 93 flow
[2023-08-04 04:23:37,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-04 04:23:37,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-04 04:23:37,734 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-04 04:23:37,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-04 04:23:37,734 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-08-04 04:23:37,734 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-04 04:23:37,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 2032773347, now seen corresponding path program 1 times
[2023-08-04 04:23:37,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-04 04:23:37,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900237786]
[2023-08-04 04:23:37,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-04 04:23:37,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-04 04:23:37,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-04 04:23:37,798 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-04 04:23:37,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-04 04:23:37,843 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-04 04:23:37,843 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-08-04 04:23:37,844 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining)
[2023-08-04 04:23:37,845 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2023-08-04 04:23:37,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-04 04:23:37,845 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-08-04 04:23:37,847 INFO  L307   ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN (1/2)
[2023-08-04 04:23:37,849 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-04 04:23:37,849 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-08-04 04:23:37,877 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:23:37 BasicIcfg
[2023-08-04 04:23:37,877 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-04 04:23:37,877 INFO  L158              Benchmark]: Toolchain (without parser) took 5485.72ms. Allocated memory is still 541.1MB. Free memory was 501.1MB in the beginning and 396.8MB in the end (delta: 104.3MB). Peak memory consumption was 107.0MB. Max. memory is 16.0GB.
[2023-08-04 04:23:37,878 INFO  L158              Benchmark]: CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory is still 326.0MB. There was no memory consumed. Max. memory is 16.0GB.
[2023-08-04 04:23:37,878 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 329.18ms. Allocated memory is still 541.1MB. Free memory was 500.7MB in the beginning and 480.2MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB.
[2023-08-04 04:23:37,878 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.21ms. Allocated memory is still 541.1MB. Free memory was 480.2MB in the beginning and 477.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2023-08-04 04:23:37,878 INFO  L158              Benchmark]: Boogie Preprocessor took 24.35ms. Allocated memory is still 541.1MB. Free memory was 477.7MB in the beginning and 475.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2023-08-04 04:23:37,879 INFO  L158              Benchmark]: RCFGBuilder took 576.18ms. Allocated memory is still 541.1MB. Free memory was 475.7MB in the beginning and 495.7MB in the end (delta: -20.0MB). Peak memory consumption was 33.2MB. Max. memory is 16.0GB.
[2023-08-04 04:23:37,879 INFO  L158              Benchmark]: TraceAbstraction took 4518.01ms. Allocated memory is still 541.1MB. Free memory was 494.6MB in the beginning and 396.8MB in the end (delta: 97.9MB). Peak memory consumption was 98.9MB. Max. memory is 16.0GB.
[2023-08-04 04:23:37,881 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory is still 326.0MB. There was no memory consumed. Max. memory is 16.0GB.
 * CACSL2BoogieTranslator took 329.18ms. Allocated memory is still 541.1MB. Free memory was 500.7MB in the beginning and 480.2MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB.
 * Boogie Procedure Inliner took 33.21ms. Allocated memory is still 541.1MB. Free memory was 480.2MB in the beginning and 477.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
 * Boogie Preprocessor took 24.35ms. Allocated memory is still 541.1MB. Free memory was 477.7MB in the beginning and 475.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
 * RCFGBuilder took 576.18ms. Allocated memory is still 541.1MB. Free memory was 475.7MB in the beginning and 495.7MB in the end (delta: -20.0MB). Peak memory consumption was 33.2MB. Max. memory is 16.0GB.
 * TraceAbstraction took 4518.01ms. Allocated memory is still 541.1MB. Free memory was 494.6MB in the beginning and 396.8MB in the end (delta: 97.9MB). Peak memory consumption was 98.9MB. Max. memory is 16.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResultAtLocation [Line: 254]: Unsoundness Warning
    unspecified type, defaulting to int C: short [254]
  - GenericResultAtLocation [Line: 254]: Unsoundness Warning
    unspecified type, defaulting to int C: short [254]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.4s, 111 PlacesBefore, 24 PlacesAfterwards, 118 TransitionsBefore, 28 TransitionsAfterwards, 2496 CoEnabledTransitionPairs, 5 FixpointIterations, 22 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 108 TotalNumberOfCompositions, 2969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2118, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1346, independent: 1304, independent conditional: 0, independent unconditional: 1304, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2118, independent: 695, independent conditional: 0, independent unconditional: 695, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1346, unknown conditional: 0, unknown unconditional: 1346] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - CounterExampleResult [Line: 759]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L714]               0  int memory[(2*960+1)];
[L715]               0  int next_alloc_idx = 1;
[L716]               0  int m = 0;
[L717]               0  int top;
[L769]               0  int m2 = 0;
[L770]               0  int state = 0;
[L788]               0  pthread_t t;
[L789]               0  int asdf=0;
        VAL             [asdf=0, m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={7:0}, top={4:0}]
[L789]  COND TRUE    0  asdf<2
[L789]  FCALL, FORK  0  pthread_create(&t, 0, thr1, 0)
        VAL             [asdf=0, m2={5:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-2, state=0, t={7:0}, top={4:0}]
[L773]  CALL         1  __VERIFIER_atomic_acquire(&m2)
[L691]  EXPR         1  \read(*m)
[L691]  CALL         1  assume_abort_if_not(*m==0)
[L4]    COND FALSE   1  !(!cond)
[L691]  RET          1  assume_abort_if_not(*m==0)
[L692]               1  *m = 1
[L773]  RET          1  __VERIFIER_atomic_acquire(&m2)
[L776]               1  case 0:
[L777]  CALL         1  EBStack_init()
[L732]               1  top = 0
[L777]  RET          1  EBStack_init()
[L778]               1  state = 1
[L779]               1  case 1:
[L780]  CALL         1  __VERIFIER_atomic_release(&m2)
[L696]  EXPR         1  \read(*m)
[L696]  CALL         1  assume_abort_if_not(*m==1)
[L4]    COND FALSE   1  !(!cond)
[L696]  RET          1  assume_abort_if_not(*m==1)
[L697]               1  *m = 0
[L780]  RET          1  __VERIFIER_atomic_release(&m2)
[L781]  CALL         1  push_loop()
[L762]               1  int r = -1;
[L763]               1  int arg = __VERIFIER_nondet_int();
[L764]  COND TRUE    1  1
[L765]  CALL, EXPR   1  push(arg)
[L741]               1  int oldTop = -1, newTop = -1, casret = -1;
[L742]  CALL, EXPR   1  index_malloc()
[L719]               1  int curr_alloc_idx = -1;
        VAL             [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}]
[L720]  CALL         1  __VERIFIER_atomic_acquire(&m)
[L691]  EXPR         1  \read(*m)
[L691]  CALL         1  assume_abort_if_not(*m==0)
[L4]    COND FALSE   1  !(!cond)
[L691]  RET          1  assume_abort_if_not(*m==0)
[L692]               1  *m = 1
[L720]  RET          1  __VERIFIER_atomic_acquire(&m)
[L721]  COND FALSE   1  !(next_alloc_idx+2-1 > (2*960+1))
[L725]               1  curr_alloc_idx = next_alloc_idx
        VAL             [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}]
[L726]               1  next_alloc_idx += 2
[L727]  CALL         1  __VERIFIER_atomic_release(&m)
[L696]  EXPR         1  \read(*m)
[L696]  CALL         1  assume_abort_if_not(*m==1)
[L4]    COND FALSE   1  !(!cond)
[L696]  RET          1  assume_abort_if_not(*m==1)
[L697]               1  *m = 0
[L727]  RET          1  __VERIFIER_atomic_release(&m)
[L729]               1  return curr_alloc_idx;
[L742]  RET, EXPR    1  index_malloc()
[L742]               1  newTop = index_malloc()
[L743]  COND FALSE   1  !(newTop == 0)
[L746]               1  memory[newTop+0] = d
        VAL             [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}]
[L747]  COND TRUE    1  1
[L748]  EXPR         1  \read(top)
[L748]               1  oldTop = top
[L749]               1  memory[newTop+1] = oldTop
[L750]  CALL         1  __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret)
[L705]  EXPR         1  \read(*v)
[L705]  COND TRUE    1  *v == e
[L707]               1  *v = u
[L707]               1  *r = 1
[L750]  RET          1  __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret)
[L751]  EXPR         1  \read(casret)
[L751]  COND TRUE    1  casret==1
[L752]               1  return 1;
        VAL             [\old(d)=0, \result=1, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}]
[L741]               1  int oldTop = -1, newTop = -1, casret = -1;
[L752]               1  return 1;
[L765]  RET, EXPR    1  push(arg)
[L765]               1  r = push(arg)
        VAL             [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, push(arg)=1, r=1, state=1, top={4:0}]
[L766]  CALL         1  __VERIFIER_atomic_assert(r)
[L759]  EXPR         1  !r || !isEmpty()
[L759]  CALL, EXPR   1  isEmpty()
[L735]  EXPR         1  \read(top)
[L735]  COND FALSE   1  !(top == 0)
[L738]               1  return 0;
[L759]  RET, EXPR    1  isEmpty()
[L759]  EXPR         1  !r || !isEmpty()
[L759]  COND TRUE    1  !(!(!r || !isEmpty()))
[L759]               1  reach_error()
        VAL             [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4:0}]

  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 179 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 32 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 76 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-08-04 04:23:37,907 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...