/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 15:39:03,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 15:39:04,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 15:39:04,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 15:39:04,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 15:39:04,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 15:39:04,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 15:39:04,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 15:39:04,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 15:39:04,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 15:39:04,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 15:39:04,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 15:39:04,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 15:39:04,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 15:39:04,041 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 15:39:04,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 15:39:04,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 15:39:04,041 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 15:39:04,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 15:39:04,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 15:39:04,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 15:39:04,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 15:39:04,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 15:39:04,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 15:39:04,043 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 15:39:04,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 15:39:04,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 15:39:04,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 15:39:04,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 15:39:04,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 15:39:04,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:39:04,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 15:39:04,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 15:39:04,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 15:39:04,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 15:39:04,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 15:39:04,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 15:39:04,046 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 15:39:04,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 15:39:04,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 15:39:04,046 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 15:39:04,047 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 -> TOGETHER [2023-08-03 15:39:04,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 15:39:04,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 15:39:04,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 15:39:04,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 15:39:04,211 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 15:39:04,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i [2023-08-03 15:39:05,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 15:39:05,369 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 15:39:05,369 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i [2023-08-03 15:39:05,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbea73ea/1b7f66900f40422eb83dceb547161c91/FLAGf13636c96 [2023-08-03 15:39:05,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbea73ea/1b7f66900f40422eb83dceb547161c91 [2023-08-03 15:39:05,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 15:39:05,388 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 15:39:05,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 15:39:05,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 15:39:05,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 15:39:05,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71553616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05, skipping insertion in model container [2023-08-03 15:39:05,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,427 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 15:39:05,631 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_04_incdec_cas_bound2.i[30285,30298] [2023-08-03 15:39:05,637 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_04_incdec_cas_bound2.i[30729,30742] [2023-08-03 15:39:05,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:39:05,653 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 15:39:05,676 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-03 15:39:05,677 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-03 15:39:05,683 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [686] [2023-08-03 15:39:05,683 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [687] [2023-08-03 15:39:05,683 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [688] [2023-08-03 15:39:05,683 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [689] [2023-08-03 15:39:05,683 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [690] [2023-08-03 15:39:05,684 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [701] [2023-08-03 15:39:05,684 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [702] [2023-08-03 15:39:05,687 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [703] [2023-08-03 15:39:05,687 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [704] [2023-08-03 15:39:05,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_04_incdec_cas_bound2.i[30285,30298] [2023-08-03 15:39:05,691 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [708] [2023-08-03 15:39:05,691 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [709] [2023-08-03 15:39:05,693 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [722] [2023-08-03 15:39:05,694 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_04_incdec_cas_bound2.i[30729,30742] [2023-08-03 15:39:05,695 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [726] [2023-08-03 15:39:05,695 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [727] [2023-08-03 15:39:05,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:39:05,727 INFO L206 MainTranslator]: Completed translation [2023-08-03 15:39:05,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05 WrapperNode [2023-08-03 15:39:05,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 15:39:05,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 15:39:05,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 15:39:05,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 15:39:05,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,778 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2023-08-03 15:39:05,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 15:39:05,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 15:39:05,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 15:39:05,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 15:39:05,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 15:39:05,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 15:39:05,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 15:39:05,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 15:39:05,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (1/1) ... [2023-08-03 15:39:05,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:39:05,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:39:05,843 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-03 15:39:05,864 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-03 15:39:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 15:39:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-03 15:39:05,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-03 15:39:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 15:39:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 15:39:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 15:39:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 15:39:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 15:39:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 15:39:05,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 15:39:05,876 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 15:39:05,984 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 15:39:05,985 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 15:39:06,165 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 15:39:06,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 15:39:06,279 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 15:39:06,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:39:06 BoogieIcfgContainer [2023-08-03 15:39:06,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 15:39:06,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 15:39:06,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 15:39:06,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 15:39:06,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 03:39:05" (1/3) ... [2023-08-03 15:39:06,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6806820f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:39:06, skipping insertion in model container [2023-08-03 15:39:06,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:39:05" (2/3) ... [2023-08-03 15:39:06,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6806820f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:39:06, skipping insertion in model container [2023-08-03 15:39:06,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:39:06" (3/3) ... [2023-08-03 15:39:06,287 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-ext_04_incdec_cas_bound2.i [2023-08-03 15:39:06,292 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 15:39:06,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 15:39:06,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 15:39:06,298 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 15:39:06,355 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 15:39:06,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 209 flow [2023-08-03 15:39:06,445 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2023-08-03 15:39:06,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:39:06,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 9/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-03 15:39:06,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 102 transitions, 209 flow [2023-08-03 15:39:06,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 102 transitions, 209 flow [2023-08-03 15:39:06,453 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:39:06,459 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 102 transitions, 209 flow [2023-08-03 15:39:06,460 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 102 transitions, 209 flow [2023-08-03 15:39:06,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 209 flow [2023-08-03 15:39:06,474 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2023-08-03 15:39:06,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:39:06,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 9/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-03 15:39:06,478 INFO L119 LiptonReduction]: Number of co-enabled transitions 2080 [2023-08-03 15:39:08,935 INFO L134 LiptonReduction]: Checked pairs total: 2550 [2023-08-03 15:39:08,935 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-03 15:39:08,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:39:08,948 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;@1dc84cb3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:39:08,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 15:39:08,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:39:08,950 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-03 15:39:08,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:39:08,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:39:08,951 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 15:39:08,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 15:39:08,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:39:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 531493076, now seen corresponding path program 1 times [2023-08-03 15:39:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:39:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043365362] [2023-08-03 15:39:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:39:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:39:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:39:09,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:39:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:39:09,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:39:09,063 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:39:09,064 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 15:39:09,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 15:39:09,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 15:39:09,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-03 15:39:09,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 15:39:09,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 15:39:09,066 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 15:39:09,067 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 15:39:09,067 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 15:39:09,117 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 15:39:09,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 168 transitions, 348 flow [2023-08-03 15:39:09,151 INFO L124 PetriNetUnfolderBase]: 17/193 cut-off events. [2023-08-03 15:39:09,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 15:39:09,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 17/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 608 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2023-08-03 15:39:09,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 168 transitions, 348 flow [2023-08-03 15:39:09,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 168 transitions, 348 flow [2023-08-03 15:39:09,160 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:39:09,160 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 168 transitions, 348 flow [2023-08-03 15:39:09,161 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 168 transitions, 348 flow [2023-08-03 15:39:09,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 168 transitions, 348 flow [2023-08-03 15:39:09,196 INFO L124 PetriNetUnfolderBase]: 17/193 cut-off events. [2023-08-03 15:39:09,196 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 15:39:09,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 17/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 608 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2023-08-03 15:39:09,203 INFO L119 LiptonReduction]: Number of co-enabled transitions 12740 [2023-08-03 15:39:12,839 INFO L134 LiptonReduction]: Checked pairs total: 19805 [2023-08-03 15:39:12,839 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-03 15:39:12,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:39:12,841 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;@1dc84cb3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:39:12,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 15:39:12,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:39:12,844 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-03 15:39:12,844 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-03 15:39:12,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:39:12,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:39:12,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:39:12,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:39:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1126350977, now seen corresponding path program 1 times [2023-08-03 15:39:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:39:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278914112] [2023-08-03 15:39:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:39:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:39:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:39:12,918 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-03 15:39:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:39:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278914112] [2023-08-03 15:39:12,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278914112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:39:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:39:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:39:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378486071] [2023-08-03 15:39:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:39:12,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-03 15:39:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:39:12,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-03 15:39:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-03 15:39:12,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 314 [2023-08-03 15:39:12,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 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-03 15:39:12,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:39:12,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 314 [2023-08-03 15:39:12,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:39:13,294 INFO L124 PetriNetUnfolderBase]: 2385/3497 cut-off events. [2023-08-03 15:39:13,295 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-03 15:39:13,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 3497 events. 2385/3497 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17204 event pairs, 1725 based on Foata normal form. 0/2298 useless extension candidates. Maximal degree in co-relation 1665. Up to 3477 conditions per place. [2023-08-03 15:39:13,311 INFO L140 encePairwiseOnDemand]: 310/314 looper letters, 46 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-03 15:39:13,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 200 flow [2023-08-03 15:39:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-03 15:39:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-03 15:39:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 348 transitions. [2023-08-03 15:39:13,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.554140127388535 [2023-08-03 15:39:13,326 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 348 transitions. [2023-08-03 15:39:13,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 348 transitions. [2023-08-03 15:39:13,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:39:13,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 348 transitions. [2023-08-03 15:39:13,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:39:13,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 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-03 15:39:13,342 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 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-03 15:39:13,344 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 348 transitions. [2023-08-03 15:39:13,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 200 flow [2023-08-03 15:39:13,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 198 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 15:39:13,348 INFO L231 Difference]: Finished difference. Result has 44 places, 48 transitions, 106 flow [2023-08-03 15:39:13,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=48} [2023-08-03 15:39:13,351 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-03 15:39:13,351 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 48 transitions, 106 flow [2023-08-03 15:39:13,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 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-03 15:39:13,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:39:13,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:39:13,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 15:39:13,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:39:13,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:39:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -86959435, now seen corresponding path program 1 times [2023-08-03 15:39:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:39:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963655506] [2023-08-03 15:39:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:39:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:39:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:39:14,138 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-03 15:39:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:39:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963655506] [2023-08-03 15:39:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963655506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:39:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:39:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-03 15:39:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132917287] [2023-08-03 15:39:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:39:14,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 15:39:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:39:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 15:39:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-03 15:39:14,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 314 [2023-08-03 15:39:14,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 48 transitions, 106 flow. Second operand has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-03 15:39:14,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:39:14,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 314 [2023-08-03 15:39:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:39:15,137 INFO L124 PetriNetUnfolderBase]: 3836/5717 cut-off events. [2023-08-03 15:39:15,137 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-08-03 15:39:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11504 conditions, 5717 events. 3836/5717 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 32719 event pairs, 586 based on Foata normal form. 0/3881 useless extension candidates. Maximal degree in co-relation 11499. Up to 2865 conditions per place. [2023-08-03 15:39:15,154 INFO L140 encePairwiseOnDemand]: 298/314 looper letters, 222 selfloop transitions, 36 changer transitions 0/260 dead transitions. [2023-08-03 15:39:15,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 260 transitions, 1076 flow [2023-08-03 15:39:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 15:39:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 15:39:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2042 transitions. [2023-08-03 15:39:15,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5002449779519843 [2023-08-03 15:39:15,159 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2042 transitions. [2023-08-03 15:39:15,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2042 transitions. [2023-08-03 15:39:15,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:39:15,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2042 transitions. [2023-08-03 15:39:15,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 157.07692307692307) internal successors, (2042), 13 states have internal predecessors, (2042), 0 states have call successors, (0), 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-03 15:39:15,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 314.0) internal successors, (4396), 14 states have internal predecessors, (4396), 0 states have call successors, (0), 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-03 15:39:15,169 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 314.0) internal successors, (4396), 14 states have internal predecessors, (4396), 0 states have call successors, (0), 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-03 15:39:15,170 INFO L175 Difference]: Start difference. First operand has 44 places, 48 transitions, 106 flow. Second operand 13 states and 2042 transitions. [2023-08-03 15:39:15,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 260 transitions, 1076 flow [2023-08-03 15:39:15,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 260 transitions, 1076 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:39:15,173 INFO L231 Difference]: Finished difference. Result has 66 places, 84 transitions, 357 flow [2023-08-03 15:39:15,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=357, PETRI_PLACES=66, PETRI_TRANSITIONS=84} [2023-08-03 15:39:15,173 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-03 15:39:15,173 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 84 transitions, 357 flow [2023-08-03 15:39:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-03 15:39:15,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:39:15,174 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 15:39:15,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 15:39:15,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:39:15,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:39:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash 537800154, now seen corresponding path program 1 times [2023-08-03 15:39:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:39:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073855109] [2023-08-03 15:39:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:39:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:39:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:39:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:39:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:39:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073855109] [2023-08-03 15:39:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073855109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:39:15,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:39:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:39:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562821506] [2023-08-03 15:39:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:39:15,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:39:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:39:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:39:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:39:15,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 314 [2023-08-03 15:39:15,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 84 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 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-03 15:39:15,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:39:15,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 314 [2023-08-03 15:39:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:39:15,583 INFO L124 PetriNetUnfolderBase]: 2789/4209 cut-off events. [2023-08-03 15:39:15,583 INFO L125 PetriNetUnfolderBase]: For 7174/7174 co-relation queries the response was YES. [2023-08-03 15:39:15,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12212 conditions, 4209 events. 2789/4209 cut-off events. For 7174/7174 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 21898 event pairs, 216 based on Foata normal form. 440/4114 useless extension candidates. Maximal degree in co-relation 12196. Up to 3014 conditions per place. [2023-08-03 15:39:15,603 INFO L140 encePairwiseOnDemand]: 310/314 looper letters, 159 selfloop transitions, 7 changer transitions 1/168 dead transitions. [2023-08-03 15:39:15,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 168 transitions, 1031 flow [2023-08-03 15:39:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:39:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:39:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 824 transitions. [2023-08-03 15:39:15,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248407643312102 [2023-08-03 15:39:15,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 824 transitions. [2023-08-03 15:39:15,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 824 transitions. [2023-08-03 15:39:15,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:39:15,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 824 transitions. [2023-08-03 15:39:15,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 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-03 15:39:15,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 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-03 15:39:15,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 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-03 15:39:15,609 INFO L175 Difference]: Start difference. First operand has 66 places, 84 transitions, 357 flow. Second operand 5 states and 824 transitions. [2023-08-03 15:39:15,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 168 transitions, 1031 flow [2023-08-03 15:39:15,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 168 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:39:15,623 INFO L231 Difference]: Finished difference. Result has 71 places, 86 transitions, 413 flow [2023-08-03 15:39:15,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=71, PETRI_TRANSITIONS=86} [2023-08-03 15:39:15,624 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-03 15:39:15,624 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 86 transitions, 413 flow [2023-08-03 15:39:15,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 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-03 15:39:15,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:39:15,624 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:39:15,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 15:39:15,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:39:15,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:39:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 142922753, now seen corresponding path program 1 times [2023-08-03 15:39:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:39:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630484969] [2023-08-03 15:39:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:39:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:39:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:39:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:39:16,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:39:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630484969] [2023-08-03 15:39:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630484969] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:39:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692011806] [2023-08-03 15:39:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:39:16,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:39:16,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:39:16,019 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) [2023-08-03 15:39:16,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 15:39:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:39:16,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-03 15:39:16,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:39:16,171 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-03 15:39:16,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-03 15:39:16,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:39:16,277 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-03 15:39:16,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 15:39:16,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:39:16,408 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-03 15:39:16,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 120 [2023-08-03 15:39:16,418 INFO L351 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-08-03 15:39:16,430 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 15:39:16,439 INFO L351 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-08-03 15:39:16,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 21 [2023-08-03 15:39:16,808 INFO L322 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-08-03 15:39:16,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 165 [2023-08-03 15:39:16,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 49 [2023-08-03 15:39:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:39:16,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:39:17,016 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_102))) (or (< (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) is different from false [2023-08-03 15:39:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:39:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692011806] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:39:19,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:39:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-03 15:39:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444059424] [2023-08-03 15:39:19,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:39:19,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 15:39:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:39:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 15:39:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=284, Unknown=21, NotChecked=36, Total=420 [2023-08-03 15:39:19,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 314 [2023-08-03 15:39:19,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 86 transitions, 413 flow. Second operand has 21 states, 21 states have (on average 103.42857142857143) internal successors, (2172), 21 states have internal predecessors, (2172), 0 states have call successors, (0), 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-03 15:39:19,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:39:19,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 314 [2023-08-03 15:39:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:39:33,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:35,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:37,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:40,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:42,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:44,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:46,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:39:48,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:01,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:09,780 WARN L233 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 83 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:40:13,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:17,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:40:24,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:26,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:28,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:30,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:32,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:35,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:40:41,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:45,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:47,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:50,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:40:52,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:09,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:12,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:16,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:18,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:20,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:24,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:27,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:30,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:40,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:42,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:44,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:46,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:56,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:41:58,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:02,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:05,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:06,578 INFO L124 PetriNetUnfolderBase]: 4255/6513 cut-off events. [2023-08-03 15:42:06,579 INFO L125 PetriNetUnfolderBase]: For 15276/15276 co-relation queries the response was YES. [2023-08-03 15:42:06,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21343 conditions, 6513 events. 4255/6513 cut-off events. For 15276/15276 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 39670 event pairs, 437 based on Foata normal form. 200/5979 useless extension candidates. Maximal degree in co-relation 21324. Up to 2925 conditions per place. [2023-08-03 15:42:06,610 INFO L140 encePairwiseOnDemand]: 277/314 looper letters, 351 selfloop transitions, 270 changer transitions 72/694 dead transitions. [2023-08-03 15:42:06,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 694 transitions, 4310 flow [2023-08-03 15:42:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-03 15:42:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-03 15:42:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5248 transitions. [2023-08-03 15:42:06,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3714083510261854 [2023-08-03 15:42:06,625 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 5248 transitions. [2023-08-03 15:42:06,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 5248 transitions. [2023-08-03 15:42:06,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:42:06,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 5248 transitions. [2023-08-03 15:42:06,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 116.62222222222222) internal successors, (5248), 45 states have internal predecessors, (5248), 0 states have call successors, (0), 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-03 15:42:06,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 314.0) internal successors, (14444), 46 states have internal predecessors, (14444), 0 states have call successors, (0), 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-03 15:42:06,648 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 314.0) internal successors, (14444), 46 states have internal predecessors, (14444), 0 states have call successors, (0), 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-03 15:42:06,648 INFO L175 Difference]: Start difference. First operand has 71 places, 86 transitions, 413 flow. Second operand 45 states and 5248 transitions. [2023-08-03 15:42:06,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 694 transitions, 4310 flow [2023-08-03 15:42:06,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 694 transitions, 4309 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:42:06,672 INFO L231 Difference]: Finished difference. Result has 142 places, 357 transitions, 3096 flow [2023-08-03 15:42:06,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=3096, PETRI_PLACES=142, PETRI_TRANSITIONS=357} [2023-08-03 15:42:06,673 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places. [2023-08-03 15:42:06,673 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 357 transitions, 3096 flow [2023-08-03 15:42:06,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 103.42857142857143) internal successors, (2172), 21 states have internal predecessors, (2172), 0 states have call successors, (0), 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-03 15:42:06,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:42:06,674 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:42:06,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 15:42:06,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:42:06,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:42:06,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:42:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -232578529, now seen corresponding path program 1 times [2023-08-03 15:42:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:42:06,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126368939] [2023-08-03 15:42:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:42:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:42:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:42:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:42:07,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:42:07,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126368939] [2023-08-03 15:42:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126368939] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:42:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284742219] [2023-08-03 15:42:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:42:07,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:42:07,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:42:07,800 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) [2023-08-03 15:42:07,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 15:42:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:42:07,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-03 15:42:07,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:42:08,113 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-03 15:42:08,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-03 15:42:08,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:42:08,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:42:09,184 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-03 15:42:09,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 15:42:09,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:09,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:10,261 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-03 15:42:10,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-03 15:42:10,322 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-03 15:42:10,363 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 15:42:10,400 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-03 15:42:10,447 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-03 15:42:12,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:42:12,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:42:12,293 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 42 [2023-08-03 15:42:12,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:42:12,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 39 [2023-08-03 15:42:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:42:13,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:42:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:42:15,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284742219] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:42:15,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:42:15,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-03 15:42:15,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074424892] [2023-08-03 15:42:15,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:42:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 15:42:15,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:42:15,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 15:42:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=301, Unknown=2, NotChecked=0, Total=380 [2023-08-03 15:42:19,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:24,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:27,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:30,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:30,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 314 [2023-08-03 15:42:30,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 357 transitions, 3096 flow. Second operand has 20 states, 20 states have (on average 101.65) internal successors, (2033), 20 states have internal predecessors, (2033), 0 states have call successors, (0), 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-03 15:42:30,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:42:30,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 314 [2023-08-03 15:42:30,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:42:39,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:44,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:46,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:48,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:42:50,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:11,364 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:43:13,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:16,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:19,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:21,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:24,208 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (mod .cse4 4294967296)) (.cse2 (+ 1 .cse4))) (and (= |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 0) (<= 1 |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|) (<= |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1| 1) (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_154) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_159) |c_~#value~0.base| v_ArrVal_160) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (= |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| |c_~#value~0.offset|) (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_154) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_159) |c_~#value~0.base| v_ArrVal_160) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55|) 0 1)))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55|) 0)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-08-03 15:43:26,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:29,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:33,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:40,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:51,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:43:57,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:10,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:12,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:18,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:23,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:25,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:28,571 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse3 (mod .cse8 4294967296)) (.cse1 (mod |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse0 (= .cse3 .cse1)) (.cse6 (+ 1 .cse8))) (and (or .cse0 (forall ((v_ArrVal_161 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_161))) (or (< .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_161 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) (or (< .cse1 .cse3) (not (= (mod (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)) (or (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_154) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_159) |c_~#value~0.base| v_ArrVal_160) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (or (< .cse1 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))) (not .cse0)) (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_159 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_154) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse6)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_159) |c_~#value~0.base| v_ArrVal_160) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (or (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (< .cse3 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_154) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse6)) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_159) |c_~#value~0.base| v_ArrVal_160) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55|) 0 1)))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_55|) 0)) (not (= (mod (select (select .cse7 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (< .cse3 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-08-03 15:44:32,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:34,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:39,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:44:40,473 INFO L124 PetriNetUnfolderBase]: 6455/10103 cut-off events. [2023-08-03 15:44:40,473 INFO L125 PetriNetUnfolderBase]: For 151328/151328 co-relation queries the response was YES. [2023-08-03 15:44:40,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69068 conditions, 10103 events. 6455/10103 cut-off events. For 151328/151328 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 68202 event pairs, 616 based on Foata normal form. 168/9472 useless extension candidates. Maximal degree in co-relation 69022. Up to 5458 conditions per place. [2023-08-03 15:44:40,546 INFO L140 encePairwiseOnDemand]: 285/314 looper letters, 711 selfloop transitions, 323 changer transitions 115/1150 dead transitions. [2023-08-03 15:44:40,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1150 transitions, 13358 flow [2023-08-03 15:44:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-03 15:44:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-03 15:44:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 5599 transitions. [2023-08-03 15:44:40,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35662420382165605 [2023-08-03 15:44:40,555 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 5599 transitions. [2023-08-03 15:44:40,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 5599 transitions. [2023-08-03 15:44:40,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:44:40,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 5599 transitions. [2023-08-03 15:44:40,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 111.98) internal successors, (5599), 50 states have internal predecessors, (5599), 0 states have call successors, (0), 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-03 15:44:40,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 314.0) internal successors, (16014), 51 states have internal predecessors, (16014), 0 states have call successors, (0), 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-03 15:44:40,579 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 314.0) internal successors, (16014), 51 states have internal predecessors, (16014), 0 states have call successors, (0), 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-03 15:44:40,579 INFO L175 Difference]: Start difference. First operand has 142 places, 357 transitions, 3096 flow. Second operand 50 states and 5599 transitions. [2023-08-03 15:44:40,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 1150 transitions, 13358 flow [2023-08-03 15:44:40,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 1150 transitions, 12654 flow, removed 344 selfloop flow, removed 1 redundant places. [2023-08-03 15:44:40,993 INFO L231 Difference]: Finished difference. Result has 220 places, 606 transitions, 6694 flow [2023-08-03 15:44:40,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=6694, PETRI_PLACES=220, PETRI_TRANSITIONS=606} [2023-08-03 15:44:40,993 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2023-08-03 15:44:40,993 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 606 transitions, 6694 flow [2023-08-03 15:44:40,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 101.65) internal successors, (2033), 20 states have internal predecessors, (2033), 0 states have call successors, (0), 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-03 15:44:40,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:44:40,994 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:44:40,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 15:44:41,194 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 [2023-08-03 15:44:41,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:44:41,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:44:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash -232581688, now seen corresponding path program 1 times [2023-08-03 15:44:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:44:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741707602] [2023-08-03 15:44:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:44:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:44:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:44:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:44:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:44:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741707602] [2023-08-03 15:44:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741707602] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:44:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261954612] [2023-08-03 15:44:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:44:41,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:44:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:44:41,557 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) [2023-08-03 15:44:41,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 15:44:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:44:41,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-03 15:44:41,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:44:41,786 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-03 15:44:41,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 15:44:42,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:44:42,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:44:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:44:43,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:44:43,974 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (forall ((v_z_2 Int) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_y_2 Int) (|thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (not (= (mod (select (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_218) |c_~#value~0.base| v_ArrVal_219) |thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_213) |c_~#value~0.base| v_ArrVal_214) |thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.offset| (+ (* v_y_2 4294967296) v_z_2))) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)) (<= 4294967296 v_z_2) (< v_z_2 0) (= v_z_2 0)))) is different from false [2023-08-03 15:44:44,059 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (forall ((v_z_2 Int) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_y_2 Int) (|thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (not (= (mod (select (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_218) |c_~#value~0.base| v_ArrVal_219) |thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_213) |c_~#value~0.base| v_ArrVal_214) |thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base|) 0 (+ (* v_y_2 4294967296) v_z_2))) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)) (<= 4294967296 v_z_2) (< v_z_2 0) (= v_z_2 0)))) is different from false [2023-08-03 15:44:44,219 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_2 Int) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_y_2 Int) (|thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_212))) (or (not (= (mod (select (select (store (store (store .cse0 |c_~#dec_flag~0.base| v_ArrVal_218) |c_~#value~0.base| v_ArrVal_219) |thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse0 |c_~#dec_flag~0.base| v_ArrVal_213) |c_~#value~0.base| v_ArrVal_214) |thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base|) 0 (+ (* v_y_2 4294967296) v_z_2))) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (<= 4294967296 v_z_2) (< v_z_2 0) (= v_z_2 0)))) is different from false [2023-08-03 15:44:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-03 15:44:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261954612] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:44:44,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:44:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2023-08-03 15:44:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536953743] [2023-08-03 15:44:44,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:44:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-03 15:44:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:44:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-03 15:44:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=119, Unknown=5, NotChecked=72, Total=240 [2023-08-03 15:44:44,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 314 [2023-08-03 15:44:44,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 606 transitions, 6694 flow. Second operand has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 0 states have call successors, (0), 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-03 15:44:44,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:44:44,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 314 [2023-08-03 15:44:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:44:51,687 INFO L124 PetriNetUnfolderBase]: 6324/9991 cut-off events. [2023-08-03 15:44:51,687 INFO L125 PetriNetUnfolderBase]: For 230358/230358 co-relation queries the response was YES. [2023-08-03 15:44:51,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83270 conditions, 9991 events. 6324/9991 cut-off events. For 230358/230358 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 68239 event pairs, 1363 based on Foata normal form. 49/9731 useless extension candidates. Maximal degree in co-relation 83194. Up to 8673 conditions per place. [2023-08-03 15:44:51,780 INFO L140 encePairwiseOnDemand]: 304/314 looper letters, 629 selfloop transitions, 91 changer transitions 77/798 dead transitions. [2023-08-03 15:44:51,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 798 transitions, 10520 flow [2023-08-03 15:44:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-03 15:44:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-03 15:44:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1807 transitions. [2023-08-03 15:44:51,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41105550500454957 [2023-08-03 15:44:51,783 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1807 transitions. [2023-08-03 15:44:51,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1807 transitions. [2023-08-03 15:44:51,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:44:51,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1807 transitions. [2023-08-03 15:44:51,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 129.07142857142858) internal successors, (1807), 14 states have internal predecessors, (1807), 0 states have call successors, (0), 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-03 15:44:51,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 314.0) internal successors, (4710), 15 states have internal predecessors, (4710), 0 states have call successors, (0), 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-03 15:44:51,789 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 314.0) internal successors, (4710), 15 states have internal predecessors, (4710), 0 states have call successors, (0), 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-03 15:44:51,789 INFO L175 Difference]: Start difference. First operand has 220 places, 606 transitions, 6694 flow. Second operand 14 states and 1807 transitions. [2023-08-03 15:44:51,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 798 transitions, 10520 flow [2023-08-03 15:44:52,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 798 transitions, 10056 flow, removed 214 selfloop flow, removed 2 redundant places. [2023-08-03 15:44:52,701 INFO L231 Difference]: Finished difference. Result has 235 places, 621 transitions, 6804 flow [2023-08-03 15:44:52,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=6119, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6804, PETRI_PLACES=235, PETRI_TRANSITIONS=621} [2023-08-03 15:44:52,702 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places. [2023-08-03 15:44:52,702 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 621 transitions, 6804 flow [2023-08-03 15:44:52,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 0 states have call successors, (0), 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-03 15:44:52,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:44:52,703 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:44:52,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 15:44:52,903 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 [2023-08-03 15:44:52,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 15:44:52,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:44:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2041502544, now seen corresponding path program 1 times [2023-08-03 15:44:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:44:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169298242] [2023-08-03 15:44:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:44:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:44:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:44:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:44:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:44:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169298242] [2023-08-03 15:44:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169298242] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:44:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998376835] [2023-08-03 15:44:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:44:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:44:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:44:55,432 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) [2023-08-03 15:44:55,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 15:44:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:44:55,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 109 conjunts are in the unsatisfiable core [2023-08-03 15:44:55,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:44:55,846 INFO L322 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-08-03 15:44:55,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-08-03 15:44:56,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:44:56,707 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-03 15:44:57,229 INFO L322 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-08-03 15:44:57,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-08-03 15:44:58,315 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:44:58,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2023-08-03 15:44:59,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:44:59,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:44:59,661 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-03 15:44:59,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-03 15:44:59,703 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-03 15:44:59,742 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-03 15:44:59,780 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-03 15:44:59,820 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 15:45:01,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:45:01,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:45:01,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:45:01,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2023-08-03 15:45:01,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:45:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:45:01,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:45:01,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:45:01,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:45:01,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:45:01,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 87 [2023-08-03 15:45:03,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:45:03,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:45:03,411 INFO L322 Elim1Store]: treesize reduction 92, result has 8.9 percent of original size [2023-08-03 15:45:03,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 904 treesize of output 883 [2023-08-03 15:45:03,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 116 treesize of output 114 [2023-08-03 15:45:03,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 114 treesize of output 112 [2023-08-03 15:45:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:45:04,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:45:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:45:20,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998376835] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:45:20,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:45:20,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-03 15:45:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567691318] [2023-08-03 15:45:20,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:45:20,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 15:45:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:45:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 15:45:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=661, Unknown=14, NotChecked=0, Total=812 [2023-08-03 15:45:30,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:45:32,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:45:34,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 314 [2023-08-03 15:45:34,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 621 transitions, 6804 flow. Second operand has 29 states, 29 states have (on average 93.44827586206897) internal successors, (2710), 29 states have internal predecessors, (2710), 0 states have call successors, (0), 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-03 15:45:34,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:45:34,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 314 [2023-08-03 15:45:34,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:45:55,075 WARN L233 SmtUtils]: Spent 17.37s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:46:18,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:46:34,620 WARN L233 SmtUtils]: Spent 10.84s on a formula simplification that was a NOOP. DAG size: 159 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:46:36,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:46:39,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:46:56,819 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 215 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:47:00,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:03,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:05,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:07,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:09,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:11,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:13,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:16,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:18,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:20,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:47:20,435 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (.cse2 (mod |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse3 (= .cse16 .cse2)) (.cse4 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse0 (= .cse4 .cse16)) (.cse7 (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1)) (.cse13 (not .cse3))) (and (= |c_~#inc_flag~0.base| 4) (= (select |c_#valid| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) 1) (= (select |c_#valid| 3) 1) (or .cse0 (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= (mod (select (select .cse1 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= (select (select |c_#memory_int| 5) |c_~#dec_flag~0.offset|) 0) (= |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 0) (= (select (select |c_#memory_int| 3) 0) 0) (not (= 4 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 5 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= 5 |c_~#dec_flag~0.base|) (= (select |c_#valid| 5) 1) (or .cse3 (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse6 (store (store (store .cse5 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse5 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= 0 (mod (select (select .cse6 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< .cse2 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))) (not (= 3 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (or (forall ((v_ArrVal_322 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse8 (store .cse9 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= 0 (mod (select (select .cse8 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (= .cse4 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse2 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse3) (= (select |c_#valid| 4) 1) (or (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (< .cse2 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse10 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (not .cse0)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| 4)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (not (= 5 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse12 (store (store (store .cse11 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse11 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse4)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse2 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse12 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse12 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse13) (or .cse13 (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse15 (store .cse14 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse4) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (not (= (mod (select (select .cse15 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse15 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))))))))) is different from false [2023-08-03 15:47:45,108 WARN L233 SmtUtils]: Spent 16.38s on a formula simplification that was a NOOP. DAG size: 269 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:47:55,933 WARN L233 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:47:58,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:48:00,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:05,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:07,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:09,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:11,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:23,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:25,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:27,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:48:41,121 WARN L233 SmtUtils]: Spent 10.80s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:48:57,534 WARN L233 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:49:43,237 WARN L233 SmtUtils]: Spent 27.47s on a formula simplification that was a NOOP. DAG size: 367 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:50:22,236 WARN L233 SmtUtils]: Spent 27.89s on a formula simplification. DAG size of input: 292 DAG size of output: 262 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:50:47,672 WARN L233 SmtUtils]: Spent 11.99s on a formula simplification. DAG size of input: 314 DAG size of output: 266 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:50:53,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:50:55,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:50:57,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:00,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:02,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:03,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:06,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:07,911 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse27 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod .cse27 4294967296)) (.cse9 (mod |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse6 (= .cse2 .cse9))) (let ((.cse4 (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1)) (.cse5 (+ 1 .cse27)) (.cse20 (not .cse6)) (.cse1 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (and (= |c_~#inc_flag~0.base| 4) (= (select |c_#valid| 3) 1) (= (select (select |c_#memory_int| 5) |c_~#dec_flag~0.offset|) 0) (= (select (select |c_#memory_int| 3) 0) 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse3 (store (store (store .cse0 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse0 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse3 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (= 5 |c_~#dec_flag~0.base|) (= (select |c_#valid| 5) 1) (or .cse6 (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse8 (store (store (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= .cse1 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= 0 (mod (select (select .cse8 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< .cse9 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse11 (store .cse10 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (= (mod (select (select .cse11 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse11 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0)) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0 1)))) (let ((.cse13 (store (store (store .cse12 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse12 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse2 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse13 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse13 |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0) 4294967296) 0))))))) (or (forall ((v_ArrVal_322 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse14 (store .cse15 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= 0 (mod (select (select .cse14 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (= .cse1 (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse9 (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse14 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse6) (forall ((|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0)) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0 1)))) (let ((.cse16 (store .cse17 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (not (= (mod (select (select .cse16 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (= (mod (select (select .cse16 |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0) 4294967296) 0) (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< .cse2 (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (= (select |c_#valid| 4) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse19 (store (store (store .cse18 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse18 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse9 (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse19 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse19 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse20) (forall ((|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0)) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0 1)))) (let ((.cse21 (store .cse22 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (not (= (mod (select (select .cse21 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (= (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (= (mod (select (select .cse21 |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0) 4294967296) 0) (< .cse2 (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (forall ((|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| Int)) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0 1)))) (let ((.cse23 (store (store (store .cse24 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse24 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (= 0 (mod (select (select .cse23 |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0) 4294967296)) (< .cse2 (mod (select (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (not (= (mod (select (select .cse24 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2)) (not (= (mod (select (select .cse23 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_58|) 0)))) (or .cse20 (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse26 (store .cse25 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= (mod (select (select .cse25 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (not (= (mod (select (select .cse26 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse9 (mod (select (select .cse26 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse26 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))))))))) is different from false [2023-08-03 15:51:09,127 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod .cse19 4294967296)) (.cse9 (mod |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse6 (= .cse2 .cse9))) (let ((.cse5 (+ 1 .cse19)) (.cse4 (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1)) (.cse16 (not .cse6)) (.cse1 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (and (= |c_~#inc_flag~0.base| 4) (= (select |c_#valid| 3) 1) (= (select (select |c_#memory_int| 5) |c_~#dec_flag~0.offset|) 0) (= (select (select |c_#memory_int| 3) 0) 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse3 (store (store (store .cse0 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse0 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse3 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (= 5 |c_~#dec_flag~0.base|) (= (select |c_#valid| 5) 1) (or .cse6 (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse8 (store (store (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= .cse1 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= 0 (mod (select (select .cse8 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< .cse9 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse11 (store .cse10 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (= (mod (select (select .cse11 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse11 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (forall ((v_ArrVal_322 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse12 (store .cse13 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= 0 (mod (select (select .cse12 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (= .cse1 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse9 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse12 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse6) (= (select |c_#valid| 4) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse15 (store (store (store .cse14 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse14 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse9 (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse15 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse15 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse16) (or .cse16 (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse18 (store .cse17 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (not (= (mod (select (select .cse18 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse9 (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse18 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))))))))) is different from false [2023-08-03 15:51:25,415 WARN L233 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:51:28,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:30,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:32,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:39,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:41,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:43,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:46,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:49,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:51,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:52,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:54,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:51:56,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:00,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:02,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:04,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:06,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:08,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:52:40,312 WARN L233 SmtUtils]: Spent 17.86s on a formula simplification. DAG size of input: 261 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:52:48,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:50,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:52:52,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:53:27,131 WARN L233 SmtUtils]: Spent 12.78s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:53:28,616 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (.cse2 (mod |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse3 (= .cse16 .cse2)) (.cse4 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse0 (= .cse4 .cse16)) (.cse7 (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1)) (.cse13 (not .cse3))) (and (= |c_~#inc_flag~0.base| 4) (= (select |c_#valid| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) 1) (= (select |c_#valid| 3) 1) (or .cse0 (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= (mod (select (select .cse1 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= (select (select |c_#memory_int| 5) |c_~#dec_flag~0.offset|) 0) (= |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 0) (= (select (select |c_#memory_int| 3) 0) 0) (not (= 4 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 5 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (= 5 |c_~#dec_flag~0.base|) (= (select |c_#valid| 5) 1) (or .cse3 (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse6 (store (store (store .cse5 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse5 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= 0 (mod (select (select .cse6 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< .cse2 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))) (not (= 3 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (or (forall ((v_ArrVal_322 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_312))) (let ((.cse8 (store .cse9 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= 0 (mod (select (select .cse8 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (= .cse4 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse2 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse3) (= (select |c_#valid| 4) 1) (or (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (< .cse2 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse10 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (not .cse0)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse12 (store (store (store .cse11 |c_~#inc_flag~0.base| v_ArrVal_318) |c_~#value~0.base| (store (select (store .cse11 |c_~#inc_flag~0.base| v_ArrVal_319) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_317))) (or (not (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse4)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (< .cse2 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse12 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse12 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) .cse13) (or .cse13 (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_322 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_314) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_315) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15| v_ArrVal_309) |c_~#value~0.base| v_ArrVal_311) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (let ((.cse15 (store .cse14 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_322))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse4) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_15|) (not (= (mod (select (select .cse15 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse15 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))))))))) is different from false [2023-08-03 15:53:30,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:53:32,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:53:34,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-03 15:53:36,265 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 15:53:36,276 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 15:53:36,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:53:37,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 15:53:37,461 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 15:53:37,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 15:53:37,461 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-03 15:53:37,461 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 15:53:37,461 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 15:53:37,461 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 15:53:37,462 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-08-03 15:53:37,462 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-08-03 15:53:37,462 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 15:53:37,462 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:53:37,464 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 15:53:37,464 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 15:53:37,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 03:53:37 BasicIcfg [2023-08-03 15:53:37,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 15:53:37,466 INFO L158 Benchmark]: Toolchain (without parser) took 872078.58ms. Allocated memory was 591.4MB in the beginning and 859.8MB in the end (delta: 268.4MB). Free memory was 549.3MB in the beginning and 412.7MB in the end (delta: 136.5MB). Peak memory consumption was 405.0MB. Max. memory is 16.0GB. [2023-08-03 15:53:37,466 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 337.6MB. Free memory is still 286.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:53:37,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.08ms. Allocated memory is still 591.4MB. Free memory was 548.8MB in the beginning and 528.3MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-03 15:53:37,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.71ms. Allocated memory is still 591.4MB. Free memory was 528.3MB in the beginning and 525.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 15:53:37,467 INFO L158 Benchmark]: Boogie Preprocessor took 29.59ms. Allocated memory is still 591.4MB. Free memory was 525.8MB in the beginning and 524.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:53:37,475 INFO L158 Benchmark]: RCFGBuilder took 471.71ms. Allocated memory is still 591.4MB. Free memory was 524.4MB in the beginning and 487.6MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-03 15:53:37,475 INFO L158 Benchmark]: TraceAbstraction took 871183.59ms. Allocated memory was 591.4MB in the beginning and 859.8MB in the end (delta: 268.4MB). Free memory was 486.7MB in the beginning and 412.7MB in the end (delta: 74.0MB). Peak memory consumption was 342.1MB. Max. memory is 16.0GB. [2023-08-03 15:53:37,476 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-08-03 15:53:37,476 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 337.6MB. Free memory is still 286.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 341.08ms. Allocated memory is still 591.4MB. Free memory was 548.8MB in the beginning and 528.3MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.71ms. Allocated memory is still 591.4MB. Free memory was 528.3MB in the beginning and 525.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.59ms. Allocated memory is still 591.4MB. Free memory was 525.8MB in the beginning and 524.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 471.71ms. Allocated memory is still 591.4MB. Free memory was 524.4MB in the beginning and 487.6MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 871183.59ms. Allocated memory was 591.4MB in the beginning and 859.8MB in the end (delta: 268.4MB). Free memory was 486.7MB in the beginning and 412.7MB in the end (delta: 74.0MB). Peak memory consumption was 342.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 686]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [686] - GenericResultAtLocation [Line: 687]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [687] - GenericResultAtLocation [Line: 688]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [688] - GenericResultAtLocation [Line: 689]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [689] - GenericResultAtLocation [Line: 690]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [690] - GenericResultAtLocation [Line: 701]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [701] - GenericResultAtLocation [Line: 702]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [702] - GenericResultAtLocation [Line: 703]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [703] - GenericResultAtLocation [Line: 704]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [704] - GenericResultAtLocation [Line: 708]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [708] - GenericResultAtLocation [Line: 709]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [709] - GenericResultAtLocation [Line: 722]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [722] - GenericResultAtLocation [Line: 726]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [726] - GenericResultAtLocation [Line: 727]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [727] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 97 PlacesBefore, 23 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 2080 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 2550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1923, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1167, independent: 1123, independent conditional: 0, independent unconditional: 1123, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1923, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 1167, unknown conditional: 0, unknown unconditional: 1167] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 158 PlacesBefore, 43 PlacesAfterwards, 168 TransitionsBefore, 52 TransitionsAfterwards, 12740 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 103 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 19805 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10887, independent: 10618, independent conditional: 0, independent unconditional: 10618, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6749, independent: 6676, independent conditional: 0, independent unconditional: 6676, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10887, independent: 3942, independent conditional: 0, independent unconditional: 3942, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 6749, unknown conditional: 0, unknown unconditional: 6749] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 724]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 154 locations, 5 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: 2.7s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 213 locations, 7 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: 868.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 819.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 757 mSolverCounterUnknown, 2690 SdHoareTripleChecker+Valid, 361.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2550 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 351.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2101 IncrementalHoareTripleChecker+Unchecked, 795 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9139 IncrementalHoareTripleChecker+Invalid, 12338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 30 mSDtfsCounter, 9139 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 191 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 474.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6804occurred in iteration=6, InterpolantAutomatonStates: 129, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 43.6s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 160 ConstructedInterpolants, 46 QuantifiedInterpolants, 13616 SizeOfPredicates, 75 NumberOfNonLiveVariables, 834 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 17/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown