./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 19:38:47,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 19:38:47,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 19:38:47,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 19:38:47,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 19:38:47,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 19:38:47,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 19:38:47,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 19:38:47,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 19:38:47,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 19:38:47,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 19:38:47,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 19:38:47,909 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 19:38:47,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 19:38:47,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 19:38:47,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 19:38:47,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 19:38:47,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 19:38:47,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 19:38:47,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 19:38:47,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 19:38:47,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 19:38:47,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 19:38:47,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 19:38:47,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 19:38:47,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 19:38:47,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 19:38:47,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 19:38:47,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 19:38:47,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 19:38:47,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 19:38:47,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 19:38:47,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 19:38:47,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 19:38:47,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 19:38:47,919 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 19:38:47,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 19:38:47,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 19:38:47,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 19:38:47,920 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 19:38:47,920 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 19:38:47,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 [2024-09-08 19:38:48,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 19:38:48,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 19:38:48,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 19:38:48,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 19:38:48,219 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 19:38:48,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-09-08 19:38:49,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 19:38:49,947 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 19:38:49,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-09-08 19:38:49,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1df44c849/128a4c8fba89406ba9a3578f07113bfb/FLAGd692fcafc [2024-09-08 19:38:50,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1df44c849/128a4c8fba89406ba9a3578f07113bfb [2024-09-08 19:38:50,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 19:38:50,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-08 19:38:50,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 19:38:50,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 19:38:50,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 19:38:50,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6634e26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50, skipping insertion in model container [2024-09-08 19:38:50,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 19:38:50,683 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2024-09-08 19:38:50,703 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2024-09-08 19:38:50,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 19:38:50,729 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 19:38:50,782 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2024-09-08 19:38:50,787 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2024-09-08 19:38:50,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 19:38:50,838 INFO L204 MainTranslator]: Completed translation [2024-09-08 19:38:50,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50 WrapperNode [2024-09-08 19:38:50,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 19:38:50,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 19:38:50,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 19:38:50,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 19:38:50,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,900 INFO L138 Inliner]: procedures = 174, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-09-08 19:38:50,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 19:38:50,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 19:38:50,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 19:38:50,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 19:38:50,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 19:38:50,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 19:38:50,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 19:38:50,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 19:38:50,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (1/1) ... [2024-09-08 19:38:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 19:38:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:51,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 19:38:51,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 19:38:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 19:38:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 19:38:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 19:38:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 19:38:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 19:38:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 19:38:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 19:38:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 19:38:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 19:38:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 19:38:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 19:38:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 19:38:51,064 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 19:38:51,222 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 19:38:51,224 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 19:38:51,570 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 19:38:51,574 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 19:38:51,875 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 19:38:51,876 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-08 19:38:51,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:38:51 BoogieIcfgContainer [2024-09-08 19:38:51,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 19:38:51,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 19:38:51,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 19:38:51,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 19:38:51,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:38:50" (1/3) ... [2024-09-08 19:38:51,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144a4519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:38:51, skipping insertion in model container [2024-09-08 19:38:51,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:38:50" (2/3) ... [2024-09-08 19:38:51,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144a4519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:38:51, skipping insertion in model container [2024-09-08 19:38:51,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:38:51" (3/3) ... [2024-09-08 19:38:51,889 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2024-09-08 19:38:51,909 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 19:38:51,909 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-08 19:38:51,909 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 19:38:51,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:38:52,046 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:38:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:52,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:38:52,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 19:38:52,087 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:38:52,101 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 19:38:52,108 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3fb34a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:52,108 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-08 19:38:52,224 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:52,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1577241718, now seen corresponding path program 1 times [2024-09-08 19:38:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670015879] [2024-09-08 19:38:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:52,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:52,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670015879] [2024-09-08 19:38:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670015879] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:38:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094889674] [2024-09-08 19:38:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:52,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:38:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:52,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:38:52,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:38:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:52,518 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:52,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:52,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:52,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:52,597 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 19:38:52,598 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:52,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -791172917, now seen corresponding path program 1 times [2024-09-08 19:38:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541539446] [2024-09-08 19:38:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:52,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541539446] [2024-09-08 19:38:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541539446] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:52,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483477947] [2024-09-08 19:38:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:52,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:52,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:52,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:52,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:52,947 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:52,948 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:52,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:52,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:53,130 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 19:38:53,131 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:53,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1012681165, now seen corresponding path program 1 times [2024-09-08 19:38:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:53,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879876838] [2024-09-08 19:38:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:53,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879876838] [2024-09-08 19:38:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879876838] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:53,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 19:38:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133254214] [2024-09-08 19:38:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:53,833 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:38:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:38:53,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-08 19:38:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:53,834 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:53,837 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:53,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:38:54,106 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 19:38:54,107 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:54,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1091874855, now seen corresponding path program 1 times [2024-09-08 19:38:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029087419] [2024-09-08 19:38:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:55,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029087419] [2024-09-08 19:38:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029087419] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:38:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698116872] [2024-09-08 19:38:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:55,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:38:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:55,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:38:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-08 19:38:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:55,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-08 19:38:55,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:38:55,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 19:38:55,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 19:38:55,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2024-09-08 19:38:55,568 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2024-09-08 19:38:55,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-09-08 19:38:55,629 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-09-08 19:38:55,629 INFO L378 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 1 case distinctions, treesize of input 21 treesize of output 15 [2024-09-08 19:38:55,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2024-09-08 19:38:55,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2024-09-08 19:38:55,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-09-08 19:38:55,720 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-09-08 19:38:55,720 INFO L378 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 1 case distinctions, treesize of input 11 treesize of output 15 [2024-09-08 19:38:55,732 INFO L378 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 5 treesize of output 3 [2024-09-08 19:38:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:56,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:38:56,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698116872] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:56,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 19:38:56,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2024-09-08 19:38:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081422562] [2024-09-08 19:38:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:56,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 19:38:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:56,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 19:38:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-08 19:38:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,108 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:56,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:38:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:38:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:38:56,341 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-09-08 19:38:56,343 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-08 19:38:56,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-08 19:38:56,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:38:56,554 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 19:38:56,556 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE (1/2) [2024-09-08 19:38:56,559 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:56,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:38:56,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:56,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:38:56,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-09-08 19:38:56,566 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:38:56,567 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 19:38:56,567 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3fb34a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:56,567 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:38:56,625 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:56,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash -394151212, now seen corresponding path program 1 times [2024-09-08 19:38:56,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786759358] [2024-09-08 19:38:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786759358] [2024-09-08 19:38:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786759358] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:38:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484057885] [2024-09-08 19:38:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:56,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:38:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:38:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:38:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,647 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:56,647 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:56,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,696 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 19:38:56,697 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:56,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash -107948567, now seen corresponding path program 1 times [2024-09-08 19:38:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:56,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407672243] [2024-09-08 19:38:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:38:56,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:56,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407672243] [2024-09-08 19:38:56,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407672243] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:56,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:56,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:56,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256934120] [2024-09-08 19:38:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:56,787 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:56,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:56,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,788 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:56,788 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:56,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 19:38:56,835 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:56,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash -790219429, now seen corresponding path program 1 times [2024-09-08 19:38:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309398966] [2024-09-08 19:38:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:38:56,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 19:38:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:38:56,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 19:38:56,874 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 19:38:56,874 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 19:38:56,874 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 19:38:56,878 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 19:38:56,879 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 19:38:56,880 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 19:38:56,880 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 19:38:56,928 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:38:56,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:56,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:38:56,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:56,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:38:56,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-09-08 19:38:56,938 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:38:56,938 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 19:38:56,939 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3fb34a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:56,939 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:38:57,064 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:57,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash -547030989, now seen corresponding path program 1 times [2024-09-08 19:38:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610323575] [2024-09-08 19:38:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:38:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610323575] [2024-09-08 19:38:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610323575] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:57,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:57,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:38:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937139102] [2024-09-08 19:38:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:57,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:38:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:57,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:38:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:38:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,103 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:57,104 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:57,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,195 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 19:38:57,196 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:57,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1309602451, now seen corresponding path program 1 times [2024-09-08 19:38:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:57,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634939398] [2024-09-08 19:38:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:57,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:38:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634939398] [2024-09-08 19:38:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634939398] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:57,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010698027] [2024-09-08 19:38:57,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:57,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,298 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:57,299 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:57,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:57,385 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-08 19:38:57,385 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:57,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -830454207, now seen corresponding path program 1 times [2024-09-08 19:38:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256731947] [2024-09-08 19:38:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:38:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256731947] [2024-09-08 19:38:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256731947] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109300358] [2024-09-08 19:38:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:57,492 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:57,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,494 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:57,494 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:57,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:57,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:57,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 19:38:57,546 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:38:57,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:57,547 INFO L85 PathProgramCache]: Analyzing trace with hash -670300973, now seen corresponding path program 1 times [2024-09-08 19:38:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932994980] [2024-09-08 19:38:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:38:57,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 19:38:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:38:57,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 19:38:57,574 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 19:38:57,574 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 19:38:57,574 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-08 19:38:57,576 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 19:38:57,577 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 19:38:57,578 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 19:38:57,578 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 19:38:57,649 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:38:57,654 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:57,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:38:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:57,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:38:57,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-09-08 19:38:57,662 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:38:57,662 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 19:38:57,662 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3fb34a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:38:57,662 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-08 19:38:57,852 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:57,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 103053693, now seen corresponding path program 1 times [2024-09-08 19:38:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:57,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097918056] [2024-09-08 19:38:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:38:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097918056] [2024-09-08 19:38:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097918056] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:38:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104708910] [2024-09-08 19:38:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:57,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:38:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:38:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:38:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:57,881 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:57,882 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:57,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,050 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-08 19:38:58,050 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:58,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -720353102, now seen corresponding path program 1 times [2024-09-08 19:38:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192533387] [2024-09-08 19:38:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:38:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192533387] [2024-09-08 19:38:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192533387] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707744196] [2024-09-08 19:38:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:58,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,175 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:58,175 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:58,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,280 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-08 19:38:58,280 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:58,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash 436270660, now seen corresponding path program 1 times [2024-09-08 19:38:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:58,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658696656] [2024-09-08 19:38:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:38:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658696656] [2024-09-08 19:38:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658696656] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:58,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601573151] [2024-09-08 19:38:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:58,380 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:58,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,381 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:58,381 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:58,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-08 19:38:58,482 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:58,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1558517618, now seen corresponding path program 1 times [2024-09-08 19:38:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812863034] [2024-09-08 19:38:58,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:58,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 19:38:58,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812863034] [2024-09-08 19:38:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812863034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:38:58,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:38:58,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 19:38:58,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112262603] [2024-09-08 19:38:58,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:38:58,581 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 19:38:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:38:58,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 19:38:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 19:38:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,581 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:38:58,582 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:38:58,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:38:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:38:58,784 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-08 19:38:58,784 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:38:58,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:38:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash -932595596, now seen corresponding path program 1 times [2024-09-08 19:38:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:38:58,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546373225] [2024-09-08 19:38:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:38:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:38:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:38:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546373225] [2024-09-08 19:38:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546373225] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:38:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17644069] [2024-09-08 19:38:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:38:59,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:38:59,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:38:59,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:38:59,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-08 19:38:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:38:59,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-08 19:38:59,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:39:00,053 INFO L349 Elim1Store]: treesize reduction 104, result has 21.8 percent of original size [2024-09-08 19:39:00,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 42 [2024-09-08 19:39:00,121 INFO L349 Elim1Store]: treesize reduction 122, result has 18.7 percent of original size [2024-09-08 19:39:00,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 87 [2024-09-08 19:39:00,166 INFO L349 Elim1Store]: treesize reduction 93, result has 16.2 percent of original size [2024-09-08 19:39:00,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 85 [2024-09-08 19:39:00,232 INFO L349 Elim1Store]: treesize reduction 68, result has 35.2 percent of original size [2024-09-08 19:39:00,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 64 [2024-09-08 19:39:00,395 INFO L378 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 25 treesize of output 21 [2024-09-08 19:39:00,427 INFO L378 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 19 [2024-09-08 19:39:00,460 INFO L349 Elim1Store]: treesize reduction 158, result has 0.6 percent of original size [2024-09-08 19:39:00,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 66 treesize of output 1 [2024-09-08 19:39:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 19:39:00,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:39:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17644069] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:39:00,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 19:39:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2024-09-08 19:39:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617425110] [2024-09-08 19:39:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:39:00,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:39:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:39:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:39:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-09-08 19:39:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:39:00,609 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:39:00,610 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:39:00,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:39:00,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:39:00,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:39:00,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:39:00,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:39:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:39:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:39:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:39:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:39:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 19:39:02,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-08 19:39:02,834 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-08 19:39:02,835 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:39:02,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:39:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1797087686, now seen corresponding path program 1 times [2024-09-08 19:39:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:39:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912227510] [2024-09-08 19:39:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:39:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:39:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:39:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-08 19:39:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:39:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912227510] [2024-09-08 19:39:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912227510] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:39:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743488522] [2024-09-08 19:39:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:39:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:39:03,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:39:03,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:39:03,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-08 19:39:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:39:03,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 19:39:03,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:39:03,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:03,754 INFO L349 Elim1Store]: treesize reduction 30, result has 23.1 percent of original size [2024-09-08 19:39:03,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 93 [2024-09-08 19:39:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:03,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:04,809 INFO L349 Elim1Store]: treesize reduction 271, result has 33.7 percent of original size [2024-09-08 19:39:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 873 treesize of output 1104 [2024-09-08 19:39:04,926 INFO L378 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 80 treesize of output 76 [2024-09-08 19:39:05,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:05,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:05,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,182 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:05,303 INFO L349 Elim1Store]: treesize reduction 274, result has 5.8 percent of original size [2024-09-08 19:39:05,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 939 treesize of output 1300 [2024-09-08 19:39:05,563 INFO L378 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 2568 treesize of output 2423 [2024-09-08 19:39:05,823 INFO L378 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 1987 treesize of output 1925 [2024-09-08 19:39:05,991 INFO L378 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 136 treesize of output 127 [2024-09-08 19:39:06,140 INFO L378 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 287 treesize of output 267 [2024-09-08 19:39:06,209 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 133 [2024-09-08 19:39:06,260 INFO L378 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 317 treesize of output 476 [2024-09-08 19:39:06,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 115 [2024-09-08 19:39:07,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:07,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:39:07,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:07,132 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:07,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:07,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:07,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:07,278 INFO L349 Elim1Store]: treesize reduction 116, result has 12.8 percent of original size [2024-09-08 19:39:07,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 734 treesize of output 1187 [2024-09-08 19:39:08,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2024-09-08 19:39:08,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 507 [2024-09-08 19:39:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:09,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:09,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:09,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:09,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:09,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:09,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2024-09-08 19:39:09,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:09,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:09,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2024-09-08 19:39:10,100 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:10,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:10,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2024-09-08 19:39:10,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:10,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:10,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:10,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:10,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-09-08 19:39:10,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:10,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-09-08 19:39:11,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1121 treesize of output 1189 [2024-09-08 19:39:12,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:12,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:12,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:12,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:12,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:12,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2024-09-08 19:39:12,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:12,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:12,471 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:12,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2024-09-08 19:39:12,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:12,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:13,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:13,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-08 19:39:13,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-09-08 19:39:13,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:39:13,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-09-08 19:39:14,763 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-08 19:39:14,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2024-09-08 19:39:14,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2024-09-08 19:39:14,998 INFO L378 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 315 treesize of output 474 [2024-09-08 19:39:15,737 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-08 19:40:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:40:10,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:40:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743488522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:40:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 19:40:10,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2024-09-08 19:40:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141396744] [2024-09-08 19:40:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:40:10,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:40:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:40:10,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:40:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=166, Unknown=21, NotChecked=0, Total=240 [2024-09-08 19:40:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:40:10,417 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:40:10,417 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:40:10,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:40:10,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:40:10,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:40:10,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:40:10,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 19:40:10,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:40:40,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 26.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:40:44,581 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] [2024-09-08 19:40:45,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:40:53,825 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] [2024-09-08 19:40:56,134 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] [2024-09-08 19:42:13,103 WARN L293 SmtUtils]: Spent 1.24m on a formula simplification. DAG size of input: 814 DAG size of output: 947 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-08 19:42:16,656 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] [2024-09-08 19:42:20,192 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] [2024-09-08 19:42:23,826 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] [2024-09-08 19:42:24,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:42:26,944 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] [2024-09-08 19:42:27,116 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (= 0 |c_~#value~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#dec_flag~0.base|))) (let ((.cse4 (= (select .cse1 0) 1)) (.cse47 (not .cse14)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| 0) (let ((.cse3 (= (select .cse2 0) 1))) (or (and (or (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| v_DerPreprocessor_52) |c_~#dec_flag~0.base|))) (and (= .cse0 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_52) |c_~#dec_flag~0.base|)) (= .cse0 .cse1) (= (select v_DerPreprocessor_54 0) 1) (= (select v_DerPreprocessor_52 0) 1) (= (select .cse0 0) 1) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_55) |c_~#value~0.base| v_DerPreprocessor_54) |c_~#dec_flag~0.base|) .cse0) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_45) |c_~#value~0.base| .cse0) |c_~#dec_flag~0.base|) .cse0) (= .cse0 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_58) |c_~#value~0.base| .cse0) |c_~#dec_flag~0.base|)) (= .cse0 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_48) |c_~#value~0.base| v_DerPreprocessor_54) |c_~#dec_flag~0.base|)) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_13) |c_~#value~0.base| .cse2) |c_~#dec_flag~0.base|) .cse0)))) .cse3) (and .cse4 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_39) |c_~#dec_flag~0.base| v_DerPreprocessor_40) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (select .cse13 |c_~#value~0.base|)))) (let ((.cse8 (store (store .cse10 |c_~#dec_flag~0.base| v_DerPreprocessor_34) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1))) (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (select .cse8 |c_~#value~0.base|)))) (let ((.cse9 (select |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (.cse11 (store (store .cse7 |c_~#dec_flag~0.base| (select .cse13 |c_~#dec_flag~0.base|)) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse6 (select .cse11 |c_~#value~0.base|)) (.cse5 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse9)) (.cse12 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_42) |c_~#value~0.base| v_DerPreprocessor_43) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1))) (and (= (select .cse5 |c_~#value~0.base|) .cse2) (= (select .cse6 0) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= (select v_DerPreprocessor_41 0) 1) (= (store (store .cse7 |c_~#dec_flag~0.base| .cse1) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1) .cse8) (= (select .cse9 0) 1) (= (select (store (store .cse10 |c_~#dec_flag~0.base| v_DerPreprocessor_37) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1) |c_~#dec_flag~0.base|) .cse1) (= (select (store (store .cse7 |c_~#dec_flag~0.base| v_DerPreprocessor_16) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (store .cse6 0 1)) |c_~#dec_flag~0.base|) .cse1) (= (select .cse11 |c_~#dec_flag~0.base|) .cse1) (not (= |c_~#value~0.base| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (= (select .cse12 |c_~#dec_flag~0.base|) .cse1) (= (select .cse5 |c_~#dec_flag~0.base|) .cse1) (not (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (= .cse2 (select .cse12 |c_~#value~0.base|))))))))))) (and .cse4 (exists ((v_DerPreprocessor_32 (Array Int Int))) (= .cse2 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_32) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|))) (exists ((v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select v_DerPreprocessor_29 0) 1) (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_28) |c_~#dec_flag~0.base| v_DerPreprocessor_29) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_DerPreprocessor_29) |c_~#value~0.base|) 0) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (exists ((v_DerPreprocessor_10 (Array Int Int))) (= .cse2 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_10) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|))))) .cse14) (and (let ((.cse44 (select .cse1 |c_~#value~0.offset|))) (let ((.cse27 (exists ((v_DerPreprocessor_99 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (.cse26 (exists ((v_DerPreprocessor_99 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|))) (and (= (select .cse46 |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= (store (store .cse46 |c_~#value~0.offset| .cse44) 0 1) .cse1))))) (.cse32 (exists ((v_DerPreprocessor_99 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_prenex_38) |c_~#value~0.base|))) (and (= (select v_prenex_38 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse45 |c_~#value~0.offset|)) (= (store (store .cse45 |c_~#value~0.offset| .cse44) 0 1) .cse1))))) (.cse25 (exists ((v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (and (= (select v_prenex_46 0) 1) (= (store (store v_prenex_46 |c_~#value~0.offset| .cse44) 0 1) .cse1) (= .cse2 (select (store (store |c_#memory_int| |c_~#value~0.base| v_prenex_44) |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base|))))) (.cse43 (exists ((v_prenex_265 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_prenex_265) |c_~#value~0.base|) |c_~#value~0.offset|)) (= (select v_prenex_265 0) 1)))) (.cse31 (exists ((v_prenex_40 (Array Int Int))) (= (select (store (store |c_#memory_int| |c_~#value~0.base| v_prenex_40) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|) .cse2))) (.cse24 (exists ((v_DerPreprocessor_76 (Array Int Int))) (= .cse2 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_76) |c_~#dec_flag~0.base| .cse1) |c_~#value~0.base|))))) (or (exists ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_273 (Array Int Int)) (v_y_1 Int) (v_arrayElimArr_38 (Array Int Int)) (v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_73 (Array Int Int)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_93) |c_~#dec_flag~0.base| v_DerPreprocessor_94) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_95))) (let ((.cse16 (select .cse23 |c_~#dec_flag~0.base|))) (let ((.cse21 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse23 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse16) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse16) |c_~#value~0.base|)))) (let ((.cse22 (store (store .cse21 |c_~#dec_flag~0.base| v_DerPreprocessor_61) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_33)) (.cse17 (select |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_69) |c_~#value~0.base| v_DerPreprocessor_70) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_38)) (.cse20 (* v_y_1 4294967296)) (.cse19 (select .cse17 0)) (.cse18 (select .cse22 |c_~#value~0.base|))) (and (= (select .cse15 |c_~#dec_flag~0.base|) .cse16) (= (store (store v_arrayElimArr_38 |c_~#value~0.offset| (select .cse16 |c_~#value~0.offset|)) 0 1) .cse16) (= .cse17 .cse16) (= v_DerPreprocessor_95 .cse16) (= (store (store .cse18 |c_~#value~0.offset| (select v_prenex_271 |c_~#value~0.offset|)) 0 1) v_prenex_271) (= .cse2 (select .cse15 |c_~#value~0.base|)) (not (= |c_~#value~0.base| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (not (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (<= .cse19 (+ 4294967295 .cse20)) (= .cse2 (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_272) |c_~#value~0.base| v_prenex_273) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse16) |c_~#value~0.base|)) (= (select v_arrayElimArr_33 0) 1) (= (select (store (store .cse21 |c_~#dec_flag~0.base| v_DerPreprocessor_73) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_271) |c_~#dec_flag~0.base|) .cse16) (<= .cse20 .cse19) (= (select v_arrayElimArr_38 0) 1) (= (select .cse18 |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= (select .cse22 |c_~#dec_flag~0.base|) .cse16) (= .cse1 .cse16)))))))) (and .cse24 .cse25 .cse26) (and .cse27 .cse24 .cse25) (and (exists ((v_DerPreprocessor_127 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (v_DerPreprocessor_123 (Array Int Int)) (v_DerPreprocessor_124 (Array Int Int)) (v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_130 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_118 (Array Int Int))) (let ((.cse29 (select v_DerPreprocessor_123 |c_~#value~0.offset|)) (.cse30 (select v_DerPreprocessor_60 |c_~#value~0.offset|)) (.cse28 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_126) |c_~#value~0.base| v_DerPreprocessor_127) |c_~#dec_flag~0.base|))) (and (= .cse28 .cse1) (= (select v_DerPreprocessor_121 0) 1) (= (select v_DerPreprocessor_118 |c_~#value~0.offset|) (select v_DerPreprocessor_121 |c_~#value~0.offset|)) (= (store (store v_DerPreprocessor_118 |c_~#value~0.offset| .cse29) 0 1) v_DerPreprocessor_123) (= .cse28 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_117) |c_~#value~0.base| v_DerPreprocessor_118) |c_~#dec_flag~0.base|)) (= v_DerPreprocessor_60 (store (store .cse2 |c_~#value~0.offset| .cse30) 0 1)) (= (store (store v_DerPreprocessor_121 |c_~#value~0.offset| (select v_DerPreprocessor_127 |c_~#value~0.offset|)) 0 1) v_DerPreprocessor_127) (= .cse29 (select .cse2 |c_~#value~0.offset|)) (= .cse28 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_114) |c_~#value~0.base| .cse28) |c_~#dec_flag~0.base|)) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| .cse30) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_61) |c_~#value~0.base| v_DerPreprocessor_60) |c_~#dec_flag~0.base|) .cse28) (= .cse28 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_124) |c_~#value~0.base| v_DerPreprocessor_123) |c_~#dec_flag~0.base|)) (= .cse28 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_120) |c_~#value~0.base| v_DerPreprocessor_121) |c_~#dec_flag~0.base|)) (= (select v_DerPreprocessor_118 0) 1) (= .cse28 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_130) |c_~#value~0.base| .cse28) |c_~#dec_flag~0.base|)) (= (select .cse28 0) 1)))) .cse3) (and .cse4 .cse27 .cse31 .cse24) (and .cse31 .cse24 .cse26) (and .cse32 .cse31 .cse24) (and .cse32 .cse24 .cse25) (exists ((v_prenex_270 (Array Int Int)) (v_y_1 Int) (v_prenex_220 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_267 (Array Int Int)) (v_prenex_268 (Array Int Int)) (v_prenex_269 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_219 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_96) |c_~#dec_flag~0.base| v_DerPreprocessor_97) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_98))) (let ((.cse35 (select .cse42 |c_~#dec_flag~0.base|))) (let ((.cse34 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse42 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse35) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse35) |c_~#value~0.base|)))) (let ((.cse41 (store (store .cse34 |c_~#dec_flag~0.base| v_prenex_270) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_267)) (.cse33 (select |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (let ((.cse38 (* v_y_1 4294967296)) (.cse37 (select .cse33 0)) (.cse36 (select .cse41 |c_~#value~0.base|)) (.cse40 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_221) |c_~#value~0.base| v_prenex_219) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_220)) (.cse39 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_87) |c_~#value~0.base| v_DerPreprocessor_88) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse35))) (and (= .cse33 (store (store v_prenex_220 |c_~#value~0.offset| (select .cse33 |c_~#value~0.offset|)) 0 1)) (= (select (store (store .cse34 |c_~#dec_flag~0.base| v_prenex_268) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_269) |c_~#dec_flag~0.base|) .cse35) (not (= |c_~#value~0.base| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (= (select .cse36 |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (not (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (<= .cse37 (+ 4294967295 .cse38)) (= .cse2 (select .cse39 |c_~#value~0.base|)) (= (select v_prenex_220 0) 1) (<= .cse38 .cse37) (= .cse2 (select .cse40 |c_~#value~0.base|)) (= .cse35 (select .cse41 |c_~#dec_flag~0.base|)) (= (store (store .cse36 |c_~#value~0.offset| (select v_prenex_269 |c_~#value~0.offset|)) 0 1) v_prenex_269) (= (select .cse35 0) 1) (= (select .cse40 |c_~#dec_flag~0.base|) .cse35) (= .cse35 v_DerPreprocessor_98) (= (select v_prenex_267 0) 1) (= .cse35 .cse1) (= .cse35 (select .cse39 |c_~#dec_flag~0.base|))))))))) (and .cse43 .cse24 .cse25) (and .cse4 .cse43 .cse31 .cse24)))) .cse47))) (<= 5 |c_~#dec_flag~0.base|) (let ((.cse58 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (.cse67 (= |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (.cse57 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (let ((.cse48 (= (select .cse57 0) 1)) (.cse75 (not .cse67)) (.cse59 (not .cse58))) (or (and .cse14 (or (and .cse48 (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| v_DerPreprocessor_52) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_53))) (let ((.cse51 (select .cse53 |c_~#dec_flag~0.base|))) (let ((.cse49 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_57) |c_~#dec_flag~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse51)) (.cse52 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_12) |c_~#dec_flag~0.base| v_DerPreprocessor_13) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse57)) (.cse56 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_53)) (.cse54 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_48) |c_~#value~0.base| v_DerPreprocessor_49) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_29)) (.cse55 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_45) |c_~#value~0.base| v_DerPreprocessor_46) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse51)) (.cse50 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_54) |c_~#dec_flag~0.base| v_DerPreprocessor_55) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_29))) (and (= v_DerPreprocessor_57 (select .cse49 |c_~#value~0.base|)) (= v_DerPreprocessor_54 (select .cse50 |c_~#value~0.base|)) (= (select .cse49 |c_~#dec_flag~0.base|) .cse51) (= v_DerPreprocessor_12 (select .cse52 |c_~#value~0.base|)) (= v_DerPreprocessor_52 (select .cse53 |c_~#value~0.base|)) (= (select v_DerPreprocessor_53 0) 1) (= (select .cse52 |c_~#dec_flag~0.base|) .cse51) (= (select .cse51 0) 1) (= (select .cse54 |c_~#value~0.base|) v_DerPreprocessor_49) (= .cse1 .cse51) (= (select v_arrayElimArr_29 0) 1) (= (select .cse55 |c_~#dec_flag~0.base|) .cse51) (= (select .cse56 |c_~#dec_flag~0.base|) .cse51) (= v_DerPreprocessor_10 (select .cse56 |c_~#value~0.base|)) (= (select .cse54 |c_~#dec_flag~0.base|) .cse51) (= v_DerPreprocessor_46 (select .cse55 |c_~#value~0.base|)) (= (select .cse50 |c_~#dec_flag~0.base|) .cse51)))))) .cse58) (and .cse59 (or (and .cse48 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_28) |c_~#dec_flag~0.base| v_DerPreprocessor_29) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse64 (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse60 |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_DerPreprocessor_26) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse57))) (let ((.cse63 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse64 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse57) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse57) |c_~#value~0.base|)))) (let ((.cse62 (store (store .cse63 |c_~#dec_flag~0.base| v_DerPreprocessor_13) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse61 (select .cse62 |c_~#value~0.base|))) (and (= (select .cse60 |c_~#dec_flag~0.base|) v_DerPreprocessor_29) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse61 0)) (= v_DerPreprocessor_13 (select .cse62 |c_~#dec_flag~0.base|)) (= v_DerPreprocessor_16 (select (store (store .cse63 |c_~#dec_flag~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (store .cse61 0 1)) |c_~#dec_flag~0.base|)) (= (select v_DerPreprocessor_30 0) 1) (= v_DerPreprocessor_26 (select .cse64 |c_~#dec_flag~0.base|))))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse65 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse57))) (and (= .cse2 (select .cse65 |c_~#value~0.base|)) (= v_DerPreprocessor_9 (select .cse65 |c_~#dec_flag~0.base|))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int))) (let ((.cse66 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_31) |c_~#value~0.base| v_DerPreprocessor_32) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse57))) (and (= (select .cse66 |c_~#value~0.base|) .cse2) (= (select .cse66 |c_~#dec_flag~0.base|) v_DerPreprocessor_31)))) .cse67) (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse73 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_39) |c_~#dec_flag~0.base| v_DerPreprocessor_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse72 (store |c_#memory_int| |c_~#value~0.base| (select .cse73 |c_~#value~0.base|)))) (let ((.cse69 (store (store .cse72 |c_~#dec_flag~0.base| v_DerPreprocessor_34) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1))) (let ((.cse70 (store |c_#memory_int| |c_~#value~0.base| (select .cse69 |c_~#value~0.base|)))) (let ((.cse71 (store (store .cse70 |c_~#dec_flag~0.base| (select .cse73 |c_~#dec_flag~0.base|)) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse68 (select .cse71 |c_~#value~0.base|))) (and (= (select v_DerPreprocessor_41 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse68 0)) (= .cse69 (store (store .cse70 |c_~#dec_flag~0.base| .cse1) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1)) (= (select .cse71 |c_~#dec_flag~0.base|) .cse1) (= (select (store (store .cse70 |c_~#dec_flag~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (store .cse68 0 1)) |c_~#dec_flag~0.base|) .cse1) (= (select (store (store .cse72 |c_~#dec_flag~0.base| v_DerPreprocessor_37) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1) |c_~#dec_flag~0.base|) .cse1))))))))) .cse48 .cse4 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse74 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse57))) (and (= .cse2 (select .cse74 |c_~#value~0.base|)) (= (select .cse74 |c_~#dec_flag~0.base|) .cse1)))) .cse75 (exists ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse76 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_42) |c_~#value~0.base| v_DerPreprocessor_43) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1))) (and (= .cse2 (select .cse76 |c_~#value~0.base|)) (= (select .cse76 |c_~#dec_flag~0.base|) .cse1))))))))) (and .cse47 (let ((.cse82 (select .cse57 |c_~#value~0.offset|))) (or (and .cse48 (exists ((v_DerPreprocessor_127 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_DerPreprocessor_125 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int)) (v_DerPreprocessor_123 (Array Int Int)) (v_DerPreprocessor_124 (Array Int Int)) (v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_122 (Array Int Int)) (v_DerPreprocessor_130 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_arrayElimArr_40 (Array Int Int)) (v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_129 (Array Int Int))) (let ((.cse86 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_126) |c_~#value~0.base| v_DerPreprocessor_127) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_40))) (let ((.cse78 (select .cse86 |c_~#dec_flag~0.base|))) (let ((.cse79 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_60) |c_~#dec_flag~0.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_62)) (.cse83 (select v_DerPreprocessor_125 |c_~#value~0.offset|)) (.cse84 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_120) |c_~#value~0.base| v_DerPreprocessor_121) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_122)) (.cse81 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_117) |c_~#value~0.base| v_DerPreprocessor_118) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_39)) (.cse80 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_114) |c_~#value~0.base| v_DerPreprocessor_115) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse78)) (.cse87 (select v_DerPreprocessor_62 |c_~#value~0.offset|)) (.cse85 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_129) |c_~#dec_flag~0.base| v_DerPreprocessor_130) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse78)) (.cse77 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_123) |c_~#dec_flag~0.base| v_DerPreprocessor_124) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_125))) (and (= (select .cse77 |c_~#dec_flag~0.base|) .cse78) (= v_DerPreprocessor_60 (select .cse79 |c_~#value~0.base|)) (= v_DerPreprocessor_115 (select .cse80 |c_~#value~0.base|)) (= (select .cse79 |c_~#dec_flag~0.base|) .cse78) (= .cse78 (select .cse81 |c_~#dec_flag~0.base|)) (= .cse82 .cse83) (= .cse78 (select .cse84 |c_~#dec_flag~0.base|)) (= (select v_DerPreprocessor_122 |c_~#value~0.offset|) (select v_arrayElimArr_39 |c_~#value~0.offset|)) (= v_arrayElimArr_40 (store (store v_DerPreprocessor_122 |c_~#value~0.offset| (select v_arrayElimArr_40 |c_~#value~0.offset|)) 0 1)) (= v_DerPreprocessor_125 (store (store v_arrayElimArr_39 |c_~#value~0.offset| .cse83) 0 1)) (= (select .cse85 |c_~#dec_flag~0.base|) .cse78) (= v_DerPreprocessor_121 (select .cse84 |c_~#value~0.base|)) (= v_DerPreprocessor_118 (select .cse81 |c_~#value~0.base|)) (= 1 (select v_arrayElimArr_39 0)) (= (select .cse86 |c_~#value~0.base|) v_DerPreprocessor_127) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| .cse87) (= .cse78 (select .cse80 |c_~#dec_flag~0.base|)) (= (store (store .cse57 |c_~#value~0.offset| .cse87) 0 1) v_DerPreprocessor_62) (= (select v_DerPreprocessor_122 0) 1) (= (select .cse78 0) 1) (= (select .cse85 |c_~#value~0.base|) v_DerPreprocessor_129) (= .cse78 .cse1) (= v_DerPreprocessor_123 (select .cse77 |c_~#value~0.base|))))))) .cse58) (and (or (and (or (exists ((v_prenex_270 (Array Int Int)) (v_prenex_220 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_267 (Array Int Int)) (v_prenex_268 (Array Int Int)) (v_prenex_269 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_219 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse94 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_96) |c_~#dec_flag~0.base| v_DerPreprocessor_97) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_98))) (let ((.cse89 (select .cse94 |c_~#dec_flag~0.base|))) (let ((.cse93 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse94 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse89) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse89) |c_~#value~0.base|)))) (let ((.cse90 (store (store .cse93 |c_~#dec_flag~0.base| v_prenex_270) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_267))) (let ((.cse88 (select .cse90 |c_~#value~0.base|)) (.cse91 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_87) |c_~#value~0.base| v_DerPreprocessor_88) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse89)) (.cse92 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_221) |c_~#value~0.base| v_prenex_219) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_220))) (and (= .cse57 (store (store v_prenex_220 |c_~#value~0.offset| .cse82) 0 1)) (= v_prenex_269 (store (store .cse88 |c_~#value~0.offset| (select v_prenex_269 |c_~#value~0.offset|)) 0 1)) (= .cse89 .cse1) (= .cse89 v_DerPreprocessor_98) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse88 |c_~#value~0.offset|)) (= .cse89 (select .cse90 |c_~#dec_flag~0.base|)) (= (select v_prenex_220 0) 1) (= .cse89 (select .cse91 |c_~#dec_flag~0.base|)) (= .cse2 (select .cse91 |c_~#value~0.base|)) (= (select .cse89 0) 1) (= .cse89 (select .cse92 |c_~#dec_flag~0.base|)) (= (select (store (store .cse93 |c_~#dec_flag~0.base| v_prenex_268) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_269) |c_~#dec_flag~0.base|) .cse89) (= .cse2 (select .cse92 |c_~#value~0.base|)) (= (select v_prenex_267 0) 1)))))))) (exists ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_273 (Array Int Int)) (v_arrayElimArr_38 (Array Int Int)) (v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse100 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_93) |c_~#dec_flag~0.base| v_DerPreprocessor_94) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_95))) (let ((.cse95 (select .cse100 |c_~#dec_flag~0.base|))) (let ((.cse98 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse100 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse95) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse95) |c_~#value~0.base|)))) (let ((.cse97 (store (store .cse98 |c_~#dec_flag~0.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_33))) (let ((.cse96 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_69) |c_~#value~0.base| v_DerPreprocessor_70) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_38)) (.cse99 (select .cse97 |c_~#value~0.base|))) (and (= .cse57 .cse95) (= .cse95 .cse1) (= .cse2 (select .cse96 |c_~#value~0.base|)) (= (select .cse96 |c_~#dec_flag~0.base|) .cse95) (= .cse2 (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_272) |c_~#value~0.base| v_prenex_273) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse95) |c_~#value~0.base|)) (= (select v_arrayElimArr_33 0) 1) (= (select v_arrayElimArr_38 0) 1) (= (select .cse97 |c_~#dec_flag~0.base|) .cse95) (= (select (store (store .cse98 |c_~#dec_flag~0.base| v_DerPreprocessor_73) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_271) |c_~#dec_flag~0.base|) .cse95) (= v_DerPreprocessor_95 .cse95) (= (store (store .cse99 |c_~#value~0.offset| (select v_prenex_271 |c_~#value~0.offset|)) 0 1) v_prenex_271) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse99 |c_~#value~0.offset|)) (= (store (store v_arrayElimArr_38 |c_~#value~0.offset| (select .cse95 |c_~#value~0.offset|)) 0 1) .cse95))))))))) .cse75) (and (or (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse102 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse101 (select .cse102 |c_~#dec_flag~0.base|))) (and (= .cse101 v_prenex_41) (= .cse2 (select .cse102 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse108 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse104 (select .cse108 |c_~#dec_flag~0.base|))) (let ((.cse103 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse104)) (.cse106 (store |c_#memory_int| |c_~#value~0.base| (select .cse108 |c_~#value~0.base|)))) (and (= .cse2 (select .cse103 |c_~#value~0.base|)) (= (select .cse104 0) 1) (= (select .cse103 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (exists ((v_prenex_262 (Array Int Int)) (v_prenex_263 (Array Int Int)) (v_prenex_264 (Array Int Int)) (v_prenex_265 (Array Int Int))) (let ((.cse107 (store (store .cse106 |c_~#dec_flag~0.base| v_prenex_265) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_263))) (let ((.cse105 (select .cse107 |c_~#value~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse105 |c_~#value~0.offset|)) (= (select v_prenex_263 0) 1) (= (select (store (store .cse106 |c_~#dec_flag~0.base| v_prenex_264) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_262) |c_~#dec_flag~0.base|) v_prenex_264) (= (store (store .cse105 |c_~#value~0.offset| (select v_prenex_262 |c_~#value~0.offset|)) 0 1) v_prenex_262) (= (select .cse107 |c_~#dec_flag~0.base|) v_prenex_265))))) (= .cse104 .cse1) (= .cse101 .cse104) (= v_DerPreprocessor_100 .cse104) (= v_DerPreprocessor_84 (select (store (store .cse106 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse104) |c_~#dec_flag~0.base|))))))))))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse109 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse109 |c_~#dec_flag~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse117 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse111 (select .cse117 |c_~#dec_flag~0.base|))) (let ((.cse110 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse111)) (.cse115 (store |c_#memory_int| |c_~#value~0.base| (select .cse117 |c_~#value~0.base|)))) (and (= .cse2 (select .cse110 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse111 |c_~#value~0.offset|)) 0 1) .cse111) (= (select .cse110 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse111 .cse1) (exists ((v_prenex_257 (Array Int Int)) (v_prenex_258 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_259 (Array Int Int))) (let ((.cse116 (store (store .cse115 |c_~#dec_flag~0.base| v_prenex_259) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_258))) (let ((.cse113 (select .cse116 |c_~#dec_flag~0.base|)) (.cse114 (select .cse116 |c_~#value~0.base|)) (.cse112 (select (store (store .cse115 |c_~#dec_flag~0.base| v_prenex_39) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_257) |c_~#dec_flag~0.base|))) (and (= .cse112 .cse111) (= .cse113 .cse111) (= .cse113 v_prenex_259) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse114 |c_~#value~0.offset|)) (= (store (store .cse114 |c_~#value~0.offset| (select v_prenex_257 |c_~#value~0.offset|)) 0 1) v_prenex_257) (= .cse112 v_prenex_39))))) (= v_DerPreprocessor_100 .cse111) (= v_DerPreprocessor_84 (select (store (store .cse115 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse111) |c_~#dec_flag~0.base|))))))) (= (select .cse109 |c_~#value~0.base|) .cse2) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse118 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse118 |c_~#dec_flag~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse125 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse120 (select .cse125 |c_~#dec_flag~0.base|))) (let ((.cse119 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse120)) (.cse123 (store |c_#memory_int| |c_~#value~0.base| (select .cse125 |c_~#value~0.base|)))) (and (= .cse2 (select .cse119 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse120 |c_~#value~0.offset|)) 0 1) .cse120) (exists ((v_DerPreprocessor_74 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse124 (store (store .cse123 |c_~#dec_flag~0.base| v_prenex_45) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_34))) (let ((.cse121 (select .cse124 |c_~#value~0.base|)) (.cse122 (select .cse124 |c_~#dec_flag~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse121 |c_~#value~0.offset|)) (= v_prenex_45 .cse122) (= (store (store .cse121 |c_~#value~0.offset| (select v_DerPreprocessor_74 |c_~#value~0.offset|)) 0 1) v_DerPreprocessor_74) (= .cse122 .cse120) (= (select (store (store .cse123 |c_~#dec_flag~0.base| v_prenex_43) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_74) |c_~#dec_flag~0.base|) v_prenex_43))))) (= (select .cse119 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse120 .cse1) (= v_DerPreprocessor_100 .cse120) (= v_DerPreprocessor_84 (select (store (store .cse123 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse120) |c_~#dec_flag~0.base|))))))) (= (select .cse118 |c_~#value~0.base|) .cse2) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse135 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse133 (select .cse135 |c_~#dec_flag~0.base|))) (and (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse134 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse127 (select .cse134 |c_~#dec_flag~0.base|))) (let ((.cse126 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse127)) (.cse131 (store |c_#memory_int| |c_~#value~0.base| (select .cse134 |c_~#value~0.base|)))) (and (= .cse2 (select .cse126 |c_~#value~0.base|)) (= (select .cse126 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse127 .cse1) (exists ((v_prenex_257 (Array Int Int)) (v_prenex_258 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_259 (Array Int Int))) (let ((.cse132 (store (store .cse131 |c_~#dec_flag~0.base| v_prenex_259) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_258))) (let ((.cse129 (select .cse132 |c_~#dec_flag~0.base|)) (.cse130 (select .cse132 |c_~#value~0.base|)) (.cse128 (select (store (store .cse131 |c_~#dec_flag~0.base| v_prenex_39) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_257) |c_~#dec_flag~0.base|))) (and (= .cse128 .cse127) (= .cse129 .cse127) (= .cse129 v_prenex_259) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse130 |c_~#value~0.offset|)) (= (store (store .cse130 |c_~#value~0.offset| (select v_prenex_257 |c_~#value~0.offset|)) 0 1) v_prenex_257) (= .cse128 v_prenex_39))))) (= .cse133 .cse127) (= v_DerPreprocessor_100 .cse127) (= v_DerPreprocessor_84 (select (store (store .cse131 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse127) |c_~#dec_flag~0.base|))))))) (= .cse133 v_prenex_41) (= .cse2 (select .cse135 |c_~#value~0.base|)))))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse136 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse136 |c_~#dec_flag~0.base|)) (= (select .cse136 |c_~#value~0.base|) .cse2) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse143 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse138 (select .cse143 |c_~#dec_flag~0.base|))) (let ((.cse137 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse138)) (.cse142 (store |c_#memory_int| |c_~#value~0.base| (select .cse143 |c_~#value~0.base|)))) (and (= .cse2 (select .cse137 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse138 |c_~#value~0.offset|)) 0 1) .cse138) (exists ((v_arrayElimArr_35 (Array Int Int)) (v_prenex_260 (Array Int Int)) (v_prenex_261 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse141 (store (store .cse142 |c_~#dec_flag~0.base| v_prenex_38) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_35))) (let ((.cse139 (select (store (store .cse142 |c_~#dec_flag~0.base| v_prenex_261) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_260) |c_~#dec_flag~0.base|)) (.cse140 (select .cse141 |c_~#value~0.base|))) (and (= .cse139 .cse138) (= (select v_arrayElimArr_35 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse140 |c_~#value~0.offset|)) (= v_prenex_261 .cse139) (= v_prenex_260 (store (store .cse140 |c_~#value~0.offset| (select v_prenex_260 |c_~#value~0.offset|)) 0 1)) (= v_prenex_38 (select .cse141 |c_~#dec_flag~0.base|)))))) (= (select .cse137 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse138 .cse1) (= v_DerPreprocessor_100 .cse138) (= v_DerPreprocessor_84 (select (store (store .cse142 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse138) |c_~#dec_flag~0.base|))))))) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse144 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse144 |c_~#dec_flag~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse150 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse146 (select .cse150 |c_~#dec_flag~0.base|))) (let ((.cse145 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse146)) (.cse148 (store |c_#memory_int| |c_~#value~0.base| (select .cse150 |c_~#value~0.base|)))) (and (= .cse2 (select .cse145 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse146 |c_~#value~0.offset|)) 0 1) .cse146) (= (select .cse145 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (exists ((v_prenex_262 (Array Int Int)) (v_prenex_263 (Array Int Int)) (v_prenex_264 (Array Int Int)) (v_prenex_265 (Array Int Int))) (let ((.cse149 (store (store .cse148 |c_~#dec_flag~0.base| v_prenex_265) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_263))) (let ((.cse147 (select .cse149 |c_~#value~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse147 |c_~#value~0.offset|)) (= (select v_prenex_263 0) 1) (= (select (store (store .cse148 |c_~#dec_flag~0.base| v_prenex_264) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_262) |c_~#dec_flag~0.base|) v_prenex_264) (= (store (store .cse147 |c_~#value~0.offset| (select v_prenex_262 |c_~#value~0.offset|)) 0 1) v_prenex_262) (= (select .cse149 |c_~#dec_flag~0.base|) v_prenex_265))))) (= .cse146 .cse1) (= v_DerPreprocessor_100 .cse146) (= v_DerPreprocessor_84 (select (store (store .cse148 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse146) |c_~#dec_flag~0.base|))))))) (= (select .cse144 |c_~#value~0.base|) .cse2) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse152 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse151 (select .cse152 |c_~#dec_flag~0.base|))) (and (= .cse151 v_prenex_41) (= .cse2 (select .cse152 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse159 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse156 (select .cse159 |c_~#dec_flag~0.base|))) (let ((.cse153 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse156)) (.cse157 (store |c_#memory_int| |c_~#value~0.base| (select .cse159 |c_~#value~0.base|)))) (and (= .cse2 (select .cse153 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_74 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse158 (store (store .cse157 |c_~#dec_flag~0.base| v_prenex_45) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_34))) (let ((.cse154 (select .cse158 |c_~#value~0.base|)) (.cse155 (select .cse158 |c_~#dec_flag~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse154 |c_~#value~0.offset|)) (= v_prenex_45 .cse155) (= (store (store .cse154 |c_~#value~0.offset| (select v_DerPreprocessor_74 |c_~#value~0.offset|)) 0 1) v_DerPreprocessor_74) (= .cse155 .cse156) (= (select (store (store .cse157 |c_~#dec_flag~0.base| v_prenex_43) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_74) |c_~#dec_flag~0.base|) v_prenex_43))))) (= (select .cse156 0) 1) (= (select .cse153 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse156 .cse1) (= .cse151 .cse156) (= v_DerPreprocessor_100 .cse156) (= v_DerPreprocessor_84 (select (store (store .cse157 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse156) |c_~#dec_flag~0.base|))))))))))) (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse161 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse160 (select .cse161 |c_~#dec_flag~0.base|))) (and (= .cse160 v_prenex_41) (= .cse2 (select .cse161 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse168 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse164 (select .cse168 |c_~#dec_flag~0.base|))) (let ((.cse162 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse164)) (.cse167 (store |c_#memory_int| |c_~#value~0.base| (select .cse168 |c_~#value~0.base|)))) (and (= .cse2 (select .cse162 |c_~#value~0.base|)) (exists ((v_arrayElimArr_35 (Array Int Int)) (v_prenex_260 (Array Int Int)) (v_prenex_261 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse166 (store (store .cse167 |c_~#dec_flag~0.base| v_prenex_38) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_35))) (let ((.cse163 (select (store (store .cse167 |c_~#dec_flag~0.base| v_prenex_261) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_260) |c_~#dec_flag~0.base|)) (.cse165 (select .cse166 |c_~#value~0.base|))) (and (= .cse163 .cse164) (= (select v_arrayElimArr_35 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse165 |c_~#value~0.offset|)) (= v_prenex_261 .cse163) (= v_prenex_260 (store (store .cse165 |c_~#value~0.offset| (select v_prenex_260 |c_~#value~0.offset|)) 0 1)) (= v_prenex_38 (select .cse166 |c_~#dec_flag~0.base|)))))) (= (select .cse162 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse164 .cse1) (= .cse160 .cse164) (= v_DerPreprocessor_100 .cse164) (= v_DerPreprocessor_84 (select (store (store .cse167 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse164) |c_~#dec_flag~0.base|)))))))))))) .cse67)) .cse59))))))) (<= |c_~#value~0.base| 3) (= |c_~#dec_flag~0.offset| 0)))) is different from true [2024-09-08 19:42:29,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:42:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:42:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:42:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:42:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 19:42:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 19:42:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 19:42:31,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-08 19:42:31,583 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-08 19:42:31,583 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:42:31,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:42:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1792407949, now seen corresponding path program 1 times [2024-09-08 19:42:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:42:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436346484] [2024-09-08 19:42:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:42:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:42:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:42:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:42:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:42:38,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436346484] [2024-09-08 19:42:38,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436346484] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:42:38,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909245095] [2024-09-08 19:42:38,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:42:38,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:42:38,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:42:38,299 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:42:38,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-08 19:42:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:42:38,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-08 19:42:38,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:42:40,342 INFO L378 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 6 treesize of output 5 [2024-09-08 19:42:41,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 19:42:41,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 19:42:44,590 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-09-08 19:42:44,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 65 [2024-09-08 19:42:44,678 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-08 19:42:44,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 61 [2024-09-08 19:42:44,738 INFO L378 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 90 treesize of output 83 [2024-09-08 19:42:44,777 INFO L378 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 19 treesize of output 18 [2024-09-08 19:42:45,266 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-09-08 19:42:45,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 60 [2024-09-08 19:42:45,592 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-08 19:42:45,593 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 98 [2024-09-08 19:42:46,827 INFO L349 Elim1Store]: treesize reduction 40, result has 41.2 percent of original size [2024-09-08 19:42:46,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2024-09-08 19:42:46,929 INFO L378 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 16 [2024-09-08 19:42:47,436 INFO L349 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2024-09-08 19:42:47,437 INFO L378 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 1 case distinctions, treesize of input 23 treesize of output 40 [2024-09-08 19:42:59,191 INFO L349 Elim1Store]: treesize reduction 128, result has 25.6 percent of original size [2024-09-08 19:42:59,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 2585 treesize of output 2392 [2024-09-08 19:42:59,311 INFO L378 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 616 treesize of output 614 [2024-09-08 19:42:59,633 INFO L224 Elim1Store]: Index analysis took 238 ms [2024-09-08 19:43:01,203 INFO L349 Elim1Store]: treesize reduction 156, result has 23.2 percent of original size [2024-09-08 19:43:01,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 96 treesize of output 165 [2024-09-08 19:43:01,644 INFO L378 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 [2024-09-08 19:43:01,861 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2024-09-08 19:43:02,280 INFO L378 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 [2024-09-08 19:43:02,683 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-09-08 19:43:02,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2024-09-08 19:43:03,211 INFO L378 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 [2024-09-08 19:43:03,673 INFO L378 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 12 treesize of output 9 [2024-09-08 19:43:04,215 INFO L349 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2024-09-08 19:43:04,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 85 [2024-09-08 19:43:07,244 INFO L378 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 30 treesize of output 1 [2024-09-08 19:43:07,861 INFO L378 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 36 treesize of output 3 [2024-09-08 19:43:08,246 INFO L378 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 36 treesize of output 3 [2024-09-08 19:43:08,313 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-08 19:43:11,109 INFO L378 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 30 treesize of output 1 [2024-09-08 19:43:11,955 INFO L349 Elim1Store]: treesize reduction 43, result has 31.7 percent of original size [2024-09-08 19:43:11,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 27 Killed by 15