./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 20174008 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/02_inc_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 10:41:19,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 10:41:19,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 10:41:19,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 10:41:19,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 10:41:19,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 10:41:19,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 10:41:19,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 10:41:19,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 10:41:19,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 10:41:19,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 10:41:19,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 10:41:19,657 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 10:41:19,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 10:41:19,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 10:41:19,659 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 10:41:19,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 10:41:19,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 10:41:19,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 10:41:19,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 10:41:19,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 10:41:19,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 10:41:19,661 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 10:41:19,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 10:41:19,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 10:41:19,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 10:41:19,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 10:41:19,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 10:41:19,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 10:41:19,663 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 10:41:19,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 10:41:19,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 10:41:19,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 10:41:19,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 10:41:19,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 10:41:19,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 10:41:19,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 10:41:19,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 10:41:19,665 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 10:41:19,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 10:41:19,666 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 10:41:19,666 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 10:41:19,667 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 10:41:19,667 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 ! data-race) ) 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2023-11-24 10:41:19,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 10:41:19,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 10:41:19,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 10:41:19,913 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 10:41:19,914 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 10:41:19,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-24 10:41:21,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 10:41:21,260 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 10:41:21,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-24 10:41:21,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a90639265/da387b515e9e45d2b8f94b10fb1fa047/FLAGaae12af04 [2023-11-24 10:41:21,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a90639265/da387b515e9e45d2b8f94b10fb1fa047 [2023-11-24 10:41:21,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 10:41:21,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 10:41:21,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 10:41:21,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 10:41:21,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 10:41:21,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6003ae54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21, skipping insertion in model container [2023-11-24 10:41:21,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 10:41:21,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 10:41:21,676 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 10:41:21,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 10:41:21,741 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 10:41:21,741 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 10:41:21,747 INFO L206 MainTranslator]: Completed translation [2023-11-24 10:41:21,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21 WrapperNode [2023-11-24 10:41:21,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 10:41:21,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 10:41:21,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 10:41:21,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 10:41:21,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,797 INFO L138 Inliner]: procedures = 170, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 118 [2023-11-24 10:41:21,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 10:41:21,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 10:41:21,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 10:41:21,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 10:41:21,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 10:41:21,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 10:41:21,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 10:41:21,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 10:41:21,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (1/1) ... [2023-11-24 10:41:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 10:41:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:41:21,858 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) [2023-11-24 10:41:21,863 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 [2023-11-24 10:41:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 10:41:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-24 10:41:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-24 10:41:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 10:41:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 10:41:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 10:41:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 10:41:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 10:41:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 10:41:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 10:41:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 10:41:21,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 10:41:21,894 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 10:41:21,979 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 10:41:21,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 10:41:22,136 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 10:41:22,274 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 10:41:22,274 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 10:41:22,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:41:22 BoogieIcfgContainer [2023-11-24 10:41:22,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 10:41:22,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 10:41:22,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 10:41:22,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 10:41:22,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:41:21" (1/3) ... [2023-11-24 10:41:22,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a555d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:41:22, skipping insertion in model container [2023-11-24 10:41:22,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:41:21" (2/3) ... [2023-11-24 10:41:22,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a555d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:41:22, skipping insertion in model container [2023-11-24 10:41:22,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:41:22" (3/3) ... [2023-11-24 10:41:22,282 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-24 10:41:22,287 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 10:41:22,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 10:41:22,295 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 10:41:22,295 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 10:41:22,360 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 10:41:22,414 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:41:22,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:41:22,422 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) [2023-11-24 10:41:22,423 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 [2023-11-24 10:41:22,472 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:41:22,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-24 10:41:22,487 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@21aa6c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:22,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-24 10:41:22,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:41:22,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:41:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1616438857, now seen corresponding path program 1 times [2023-11-24 10:41:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:41:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472612890] [2023-11-24 10:41:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:41:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:41:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:41:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 10:41:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:41:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472612890] [2023-11-24 10:41:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472612890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:41:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:41:22,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 10:41:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161408490] [2023-11-24 10:41:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:41:22,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 10:41:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:41:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 10:41:22,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 10:41:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:22,948 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:41:22,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:41:22,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:23,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 10:41:23,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:41:23,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:41:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash 800661187, now seen corresponding path program 1 times [2023-11-24 10:41:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:41:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937274645] [2023-11-24 10:41:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:41:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:41:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:41:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 10:41:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:41:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937274645] [2023-11-24 10:41:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937274645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:41:23,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:41:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:41:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219565441] [2023-11-24 10:41:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:41:23,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:41:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:41:23,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:41:23,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:41:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:23,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:41:23,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:41:23,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:23,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:41:26,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2023-11-24 10:41:26,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-24 10:41:26,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-24 10:41:26,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-24 10:41:26,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-24 10:41:26,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-24 10:41:26,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-24 10:41:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 10:41:26,130 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-24 10:41:26,134 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-11-24 10:41:26,155 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:26,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:41:26,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:41:26,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 10:41:26,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-11-24 10:41:26,227 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:41:26,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 10:41:26,230 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@21aa6c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:26,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 10:41:26,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 10:41:26,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:41:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash 34926398, now seen corresponding path program 1 times [2023-11-24 10:41:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:41:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298111634] [2023-11-24 10:41:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:41:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:41:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:41:26,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 10:41:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:41:26,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 10:41:26,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 10:41:26,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 10:41:26,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 10:41:26,367 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-24 10:41:26,367 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-24 10:41:26,368 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 10:41:26,368 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 10:41:26,406 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 10:41:26,411 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:41:26,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:41:26,413 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) [2023-11-24 10:41:26,428 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:41:26,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 10:41:26,429 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@21aa6c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:26,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 10:41:26,464 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 [2023-11-24 10:41:26,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 10:41:26,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:41:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash -608993391, now seen corresponding path program 1 times [2023-11-24 10:41:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:41:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759049715] [2023-11-24 10:41:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:41:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:41:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:41:26,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 10:41:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:41:26,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 10:41:26,620 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 10:41:26,620 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 10:41:26,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 10:41:26,622 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-24 10:41:26,622 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-24 10:41:26,622 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 10:41:26,622 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-24 10:41:26,708 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 10:41:26,713 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:26,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:41:26,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:41:26,715 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) [2023-11-24 10:41:26,744 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 [2023-11-24 10:41:26,746 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:41:26,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-24 10:41:26,747 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@21aa6c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:41:26,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-24 10:41:26,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:41:26,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:41:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1407556793, now seen corresponding path program 1 times [2023-11-24 10:41:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:41:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371014615] [2023-11-24 10:41:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:41:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:41:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:41:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:41:27,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:41:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371014615] [2023-11-24 10:41:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371014615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:41:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:41:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 10:41:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339719759] [2023-11-24 10:41:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:41:27,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 10:41:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:41:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 10:41:27,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 10:41:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:27,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:41:27,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 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) [2023-11-24 10:41:27,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:28,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 10:41:28,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:41:28,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:41:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1300516165, now seen corresponding path program 1 times [2023-11-24 10:41:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:41:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767102426] [2023-11-24 10:41:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:41:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:41:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:41:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:41:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:41:28,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767102426] [2023-11-24 10:41:28,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767102426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:41:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:41:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:41:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119862972] [2023-11-24 10:41:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:41:28,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:41:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:41:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:41:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:41:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:28,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:41:28,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:41:28,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:41:28,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:52,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 10:42:52,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:42:52,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -960314941, now seen corresponding path program 1 times [2023-11-24 10:42:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598903908] [2023-11-24 10:42:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:52,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 37 proven. 201 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2023-11-24 10:42:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598903908] [2023-11-24 10:42:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598903908] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 10:42:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290729030] [2023-11-24 10:42:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:42:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:42:54,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 10:42:54,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 10:42:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:55,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 10:42:55,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 10:42:55,268 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 10:42:55,269 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 19 treesize of output 16 [2023-11-24 10:42:55,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 10:42:55,399 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 [2023-11-24 10:42:55,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 18 [2023-11-24 10:42:55,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 10:42:55,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 14 [2023-11-24 10:42:55,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-24 10:42:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 176 proven. 37 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-11-24 10:42:55,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 10:42:55,782 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1030) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) is different from false [2023-11-24 10:42:55,807 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1030 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1030) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (= 4294967295 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) is different from false [2023-11-24 10:42:55,814 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (forall ((v_ArrVal_1030 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1030) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) is different from false [2023-11-24 10:42:55,910 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-24 10:42:55,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 243 [2023-11-24 10:42:56,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:42:56,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 154 [2023-11-24 10:42:56,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-24 10:42:56,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:42:56,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 57 treesize of output 39 [2023-11-24 10:42:56,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2023-11-24 10:42:56,187 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 7 treesize of output 5 [2023-11-24 10:42:56,191 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 8 treesize of output 6 [2023-11-24 10:42:56,194 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 8 treesize of output 6 [2023-11-24 10:42:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 176 proven. 7 refuted. 0 times theorem prover too weak. 243 trivial. 30 not checked. [2023-11-24 10:42:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290729030] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 10:42:56,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 10:42:56,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2023-11-24 10:42:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851022703] [2023-11-24 10:42:56,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 10:42:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-24 10:42:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-24 10:42:56,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=736, Unknown=4, NotChecked=174, Total=1056 [2023-11-24 10:42:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:56,411 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:56,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:56,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:56,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:56,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:46:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:46:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:46:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-24 10:46:14,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 10:46:14,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 10:46:14,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:46:14,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:46:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1320944274, now seen corresponding path program 1 times [2023-11-24 10:46:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:46:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553233678] [2023-11-24 10:46:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:46:14,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:46:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:46:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 226 proven. 194 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-24 10:46:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:46:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553233678] [2023-11-24 10:46:17,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553233678] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 10:46:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034970935] [2023-11-24 10:46:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:46:17,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:46:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:46:17,602 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) [2023-11-24 10:46:17,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 10:46:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:46:18,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-24 10:46:18,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 10:46:18,049 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 10:46:18,049 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 19 treesize of output 16 [2023-11-24 10:46:18,132 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 10:46:18,133 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 17 treesize of output 21 [2023-11-24 10:46:18,441 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 10:46:18,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-24 10:46:19,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 10:46:19,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 10:46:19,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 10:46:19,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 10:46:19,324 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 10:46:19,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 10:46:19,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 10:46:19,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-11-24 10:46:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2023-11-24 10:46:19,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 10:46:19,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-24 10:46:22,015 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse8 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse2 (+ 3 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse3 (+ |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) (.cse4 (+ |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) (.cse1 (+ |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) (.cse6 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse10 (not .cse11))) (and (or (and (forall ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_19 .cse4))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse0)) (not (= (select v_DerPreprocessor_19 .cse1) .cse0)) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_19 .cse3) .cse0))))) (forall ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_19 .cse4))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse5)) (not (= (select v_DerPreprocessor_19 .cse1) .cse5)) (not (= (select v_DerPreprocessor_19 .cse3) .cse5)) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)))) (forall ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_19 .cse4))) (or (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse6) 0) (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse7)) (not (= (select v_DerPreprocessor_19 .cse1) .cse7)) (not (= (select v_DerPreprocessor_19 .cse3) .cse7))))) (forall ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_19 .cse4))) (or (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse8) 0) (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse9)) (not (= (select v_DerPreprocessor_19 .cse1) .cse9)) (not (= (select v_DerPreprocessor_19 .cse3) .cse9)))))) .cse10) (or .cse11 (let ((.cse15 (+ 3 |c_~#value~0.offset|)) (.cse16 (+ 1 |c_~#value~0.offset|)) (.cse17 (+ 2 |c_~#value~0.offset|))) (and (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_18 .cse4))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse12)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse18 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse14 (select .cse18 |c_~#value~0.base|))) (let ((.cse13 (select .cse14 |c_~#value~0.offset|))) (or (not (= .cse13 (select .cse14 .cse15))) (not (= .cse13 (select .cse14 .cse16))) (not (= (select .cse14 .cse17) .cse13)) (= (select (select .cse18 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse6) 0)))))) (not (= (select v_DerPreprocessor_18 .cse1) .cse12)) (not (= (select v_DerPreprocessor_18 .cse3) .cse12))))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (select v_DerPreprocessor_18 .cse4))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse19)) (not (= (select v_DerPreprocessor_18 .cse1) .cse19)) (not (= (select v_DerPreprocessor_18 .cse3) .cse19)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse20 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse22 (select .cse20 |c_~#value~0.base|))) (let ((.cse21 (select .cse22 |c_~#value~0.offset|))) (or (= (select (select .cse20 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= .cse21 (select .cse22 .cse15))) (not (= .cse21 (select .cse22 .cse16))) (not (= (select .cse22 .cse17) .cse21)))))))))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse23 (select v_DerPreprocessor_18 .cse4))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse23)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse26 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse25 (select .cse26 |c_~#value~0.base|))) (let ((.cse24 (select .cse25 |c_~#value~0.offset|))) (or (not (= .cse24 (select .cse25 .cse15))) (not (= .cse24 (select .cse25 .cse16))) (not (= (select .cse25 .cse17) .cse24)) (= (select (select .cse26 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse8) 0)))))) (not (= (select v_DerPreprocessor_18 .cse1) .cse23)) (not (= (select v_DerPreprocessor_18 .cse3) .cse23))))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse27 (select v_DerPreprocessor_18 .cse4))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse27)) (not (= (select v_DerPreprocessor_18 .cse1) .cse27)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse28 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse30 (select .cse28 |c_~#value~0.base|))) (let ((.cse29 (select .cse30 |c_~#value~0.offset|))) (or (= (select (select .cse28 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= .cse29 (select .cse30 .cse15))) (not (= .cse29 (select .cse30 .cse16))) (not (= (select .cse30 .cse17) .cse29))))))) (not (= (select v_DerPreprocessor_18 .cse3) .cse27)))))))) (or (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (and (or .cse10 (forall ((v_DerPreprocessor_8 (Array Int Int))) (let ((.cse31 (select v_DerPreprocessor_8 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse31 (select v_DerPreprocessor_8 .cse1))) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse8) 0) (not (= .cse31 (select v_DerPreprocessor_8 .cse4))) (not (= .cse31 (select v_DerPreprocessor_8 .cse3))))))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse32 (select v_DerPreprocessor_6 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_5) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= .cse32 (select v_DerPreprocessor_6 .cse4))) (not (= .cse32 (select v_DerPreprocessor_6 .cse3))) (not (= .cse32 (select v_DerPreprocessor_6 .cse1)))))) .cse11) (or .cse10 (forall ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse33 (select v_DerPreprocessor_13 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= .cse33 (select v_DerPreprocessor_13 .cse4))) (not (= (select v_DerPreprocessor_13 .cse1) .cse33)) (not (= .cse33 (select v_DerPreprocessor_13 .cse3))))))) (or .cse10 (forall ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse34 (select v_DerPreprocessor_7 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse34 (select v_DerPreprocessor_7 .cse3))) (not (= (select v_DerPreprocessor_7 .cse1) .cse34)) (not (= (select v_DerPreprocessor_7 .cse4) .cse34)) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0))))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse35 (select v_DerPreprocessor_10 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse35 (select v_DerPreprocessor_10 .cse1))) (not (= .cse35 (select v_DerPreprocessor_10 .cse3))) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse8) 0) (not (= .cse35 (select v_DerPreprocessor_10 .cse4)))))) .cse11) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse36 (select v_DerPreprocessor_12 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= .cse36 (select v_DerPreprocessor_12 .cse1))) (not (= (select v_DerPreprocessor_12 .cse3) .cse36)) (not (= (select v_DerPreprocessor_12 .cse4) .cse36))))) .cse11) (or (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse37 (select v_DerPreprocessor_15 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= (select v_DerPreprocessor_15 .cse4) .cse37)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse6) 0) (not (= (select v_DerPreprocessor_15 .cse1) .cse37)) (not (= (select v_DerPreprocessor_15 .cse3) .cse37))))) .cse11) (or (forall ((v_DerPreprocessor_16 (Array Int Int))) (let ((.cse38 (select v_DerPreprocessor_16 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse38 (select v_DerPreprocessor_16 .cse3))) (not (= (select v_DerPreprocessor_16 .cse4) .cse38)) (not (= .cse38 (select v_DerPreprocessor_16 .cse1))) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse6) 0)))) .cse10)))))) is different from false [2023-11-24 10:46:24,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse8 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse9 (+ |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) (.cse14 (+ 3 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse10 (+ |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) (.cse11 (+ |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) (.cse0 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or .cse0 (let ((.cse4 (+ 3 |c_~#value~0.offset|)) (.cse5 (+ 1 |c_~#value~0.offset|)) (.cse6 (+ 2 |c_~#value~0.offset|))) (and (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_18 .cse11))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse1)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse7 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse3 (select .cse7 |c_~#value~0.base|))) (let ((.cse2 (select .cse3 |c_~#value~0.offset|))) (or (not (= .cse2 (select .cse3 .cse4))) (not (= .cse2 (select .cse3 .cse5))) (not (= (select .cse3 .cse6) .cse2)) (= (select (select .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse8) 0)))))) (not (= (select v_DerPreprocessor_18 .cse9) .cse1)) (not (= (select v_DerPreprocessor_18 .cse10) .cse1))))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_18 .cse11))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse12)) (not (= (select v_DerPreprocessor_18 .cse9) .cse12)) (not (= (select v_DerPreprocessor_18 .cse10) .cse12)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse13 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse16 (select .cse13 |c_~#value~0.base|))) (let ((.cse15 (select .cse16 |c_~#value~0.offset|))) (or (= (select (select .cse13 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse14) 0) (not (= .cse15 (select .cse16 .cse4))) (not (= .cse15 (select .cse16 .cse5))) (not (= (select .cse16 .cse6) .cse15)))))))))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_18 .cse11))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse17)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse20 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse19 (select .cse20 |c_~#value~0.base|))) (let ((.cse18 (select .cse19 |c_~#value~0.offset|))) (or (not (= .cse18 (select .cse19 .cse4))) (not (= .cse18 (select .cse19 .cse5))) (not (= (select .cse19 .cse6) .cse18)) (= (select (select .cse20 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse21) 0)))))) (not (= (select v_DerPreprocessor_18 .cse9) .cse17)) (not (= (select v_DerPreprocessor_18 .cse10) .cse17))))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (let ((.cse22 (select v_DerPreprocessor_18 .cse11))) (or (not (= (select v_DerPreprocessor_18 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse22)) (not (= (select v_DerPreprocessor_18 .cse9) .cse22)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse23 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18))) (let ((.cse25 (select .cse23 |c_~#value~0.base|))) (let ((.cse24 (select .cse25 |c_~#value~0.offset|))) (or (= (select (select .cse23 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= .cse24 (select .cse25 .cse4))) (not (= .cse24 (select .cse25 .cse5))) (not (= (select .cse25 .cse6) .cse24))))))) (not (= (select v_DerPreprocessor_18 .cse10) .cse22)))))))) (or (and (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_19 .cse11))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse26)) (not (= (select v_DerPreprocessor_19 .cse9) .cse26)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_1915) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse21) 0) (not (= (select v_DerPreprocessor_19 .cse10) .cse26))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse27 (select v_DerPreprocessor_19 .cse11))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse27)) (not (= (select v_DerPreprocessor_19 .cse9) .cse27)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_1915) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse8) 0) (not (= (select v_DerPreprocessor_19 .cse10) .cse27))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse28 (select v_DerPreprocessor_19 .cse11))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse28)) (not (= (select v_DerPreprocessor_19 .cse9) .cse28)) (not (= (select v_DerPreprocessor_19 .cse10) .cse28)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_1915) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse29 (select v_DerPreprocessor_19 .cse11))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse29)) (not (= (select v_DerPreprocessor_19 .cse9) .cse29)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_1915) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse14) 0) (not (= (select v_DerPreprocessor_19 .cse10) .cse29)))))) (not .cse0)))) is different from false [2023-11-24 10:46:36,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 255 treesize of output 132 [2023-11-24 10:46:36,008 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 100 [2023-11-24 10:46:36,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 75 [2023-11-24 10:46:36,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 84 [2023-11-24 10:46:36,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 255 treesize of output 132 [2023-11-24 10:46:36,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 66 [2023-11-24 10:46:36,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 54 [2023-11-24 10:46:36,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 130 [2023-11-24 10:46:36,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 64 [2023-11-24 10:46:36,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 54 [2023-11-24 10:46:36,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 255 treesize of output 132 [2023-11-24 10:46:36,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:36,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 66 [2023-11-24 10:46:36,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 54 [2023-11-24 10:46:36,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2023-11-24 10:46:36,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2023-11-24 10:46:36,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:36,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 48 [2023-11-24 10:46:36,263 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 10:46:36,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-24 10:46:36,268 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 10:46:36,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-24 10:46:36,272 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 10:46:36,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-24 10:46:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 27 refuted. 24 times theorem prover too weak. 401 trivial. 0 not checked. [2023-11-24 10:46:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034970935] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 10:46:55,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 10:46:55,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 33 [2023-11-24 10:46:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782218321] [2023-11-24 10:46:55,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 10:46:55,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-24 10:46:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:46:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-24 10:46:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=751, Unknown=24, NotChecked=118, Total=1056 [2023-11-24 10:46:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:46:55,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:46:55,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.303030303030303) internal successors, (274), 33 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:46:55,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:46:55,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:46:55,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-24 10:46:55,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:47:21,564 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] [2023-11-24 10:48:47,284 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] [2023-11-24 10:48:49,515 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] [2023-11-24 10:48:51,717 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] [2023-11-24 10:48:53,889 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] [2023-11-24 10:48:55,936 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] [2023-11-24 10:48:58,049 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] [2023-11-24 10:49:00,280 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] [2023-11-24 10:49:02,535 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] [2023-11-24 10:49:04,575 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] [2023-11-24 10:49:06,640 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] [2023-11-24 10:49:08,862 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] [2023-11-24 10:49:11,005 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] [2023-11-24 10:49:13,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:49:15,496 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] [2023-11-24 10:49:17,513 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] [2023-11-24 10:49:19,579 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] [2023-11-24 10:49:21,607 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] [2023-11-24 10:49:23,812 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] [2023-11-24 10:49:25,843 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] [2023-11-24 10:49:27,851 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] [2023-11-24 10:49:29,944 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] [2023-11-24 10:49:32,014 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] [2023-11-24 10:49:34,091 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] [2023-11-24 10:49:36,099 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] [2023-11-24 10:49:38,106 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] [2023-11-24 10:49:40,161 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] [2023-11-24 10:49:42,173 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] [2023-11-24 10:49:44,298 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] [2023-11-24 10:49:46,376 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] [2023-11-24 10:49:48,401 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] [2023-11-24 10:49:50,410 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] [2023-11-24 10:49:52,488 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] [2023-11-24 10:49:54,508 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] [2023-11-24 10:49:56,517 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] [2023-11-24 10:49:58,609 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] [2023-11-24 10:50:00,620 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] [2023-11-24 10:50:02,626 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] [2023-11-24 10:50:04,707 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] [2023-11-24 10:50:06,724 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] [2023-11-24 10:50:08,887 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] [2023-11-24 10:50:11,102 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] [2023-11-24 10:50:13,312 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] [2023-11-24 10:50:15,444 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] [2023-11-24 10:50:17,499 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] [2023-11-24 10:50:19,526 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] [2023-11-24 10:50:21,589 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] [2023-11-24 10:50:26,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:50:28,730 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] [2023-11-24 10:50:30,743 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] [2023-11-24 10:50:32,806 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] [2023-11-24 10:50:34,861 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] [2023-11-24 10:50:36,978 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] [2023-11-24 10:50:38,990 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] [2023-11-24 10:50:41,100 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] [2023-11-24 10:50:43,177 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] [2023-11-24 10:50:45,338 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] [2023-11-24 10:50:47,360 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] [2023-11-24 10:50:49,382 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] [2023-11-24 10:50:51,404 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] [2023-11-24 10:50:53,427 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] [2023-11-24 10:50:55,463 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] [2023-11-24 10:50:57,485 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] [2023-11-24 10:50:59,509 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] [2023-11-24 10:51:01,570 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] [2023-11-24 10:51:03,642 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] [2023-11-24 10:51:05,748 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] [2023-11-24 10:51:07,844 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] [2023-11-24 10:51:09,937 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] [2023-11-24 10:51:11,957 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] [2023-11-24 10:51:13,977 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] [2023-11-24 10:51:16,155 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] [2023-11-24 10:51:18,176 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] [2023-11-24 10:51:20,307 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] [2023-11-24 10:51:22,324 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] [2023-11-24 10:51:24,338 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] [2023-11-24 10:51:26,730 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] [2023-11-24 10:51:34,317 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] [2023-11-24 10:51:49,006 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] [2023-11-24 10:51:55,301 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] [2023-11-24 10:52:01,416 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] [2023-11-24 10:52:09,557 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] [2023-11-24 10:52:29,094 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] [2023-11-24 10:52:54,160 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] [2023-11-24 10:53:12,257 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] [2023-11-24 10:53:14,428 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] [2023-11-24 10:53:16,765 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] [2023-11-24 10:53:18,778 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] [2023-11-24 10:53:20,845 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] [2023-11-24 10:53:22,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:53:24,906 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] [2023-11-24 10:53:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:53:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:53:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-24 10:53:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-24 10:53:24,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 10:53:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:53:25,149 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2023-11-24 10:53:25,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:53:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash 839395769, now seen corresponding path program 1 times [2023-11-24 10:53:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:53:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268537216] [2023-11-24 10:53:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:53:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:53:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:53:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 91 proven. 318 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-24 10:53:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:53:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268537216] [2023-11-24 10:53:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268537216] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 10:53:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941510682] [2023-11-24 10:53:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:53:27,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:53:27,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:53:27,541 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) [2023-11-24 10:53:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 10:53:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:53:27,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-24 10:53:27,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 10:53:28,026 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 [2023-11-24 10:53:28,213 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 10:53:28,214 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 19 treesize of output 16 [2023-11-24 10:53:28,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 10:53:28,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-11-24 10:53:28,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 10:53:28,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 10:53:28,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 10:53:29,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 10:53:29,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 10:53:29,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-11-24 10:53:29,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 10:53:29,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-11-24 10:53:29,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 21 [2023-11-24 10:53:37,908 INFO L349 Elim1Store]: treesize reduction 1064, result has 15.3 percent of original size [2023-11-24 10:53:37,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 6 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 114 case distinctions, treesize of input 192 treesize of output 305 [2023-11-24 10:53:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-11-24 10:53:39,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 10:53:39,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-24 10:53:41,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (.cse12 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse15 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse9 (not .cse12)) (.cse3 (+ 1 |c_~#value~0.offset|)) (.cse20 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse7 (+ 3 |c_~#value~0.offset|)) (.cse6 (+ 2 |c_~#value~0.offset|)) (.cse0 (not .cse10))) (and (or .cse0 (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_29) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse2 (select .cse5 |c_~#value~0.base|))) (let ((.cse1 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse4 (select .cse2 |c_~#value~0.offset|))) (or (not (= .cse1 (select v_DerPreprocessor_30 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select .cse2 .cse3) .cse4)) (not (= .cse2 v_DerPreprocessor_29)) (= (select (select .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= (select .cse2 .cse6) .cse4)) (not (= (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse1)) (not (= .cse1 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse4 (select .cse2 .cse7)))))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse8)) (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse8)) (not (= (select v_DerPreprocessor_31 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse8)) (= 0 (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|))))) .cse9))) (or .cse10 (and (or (forall ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse11 (select v_DerPreprocessor_28 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse11 (select v_DerPreprocessor_28 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse11 (select v_DerPreprocessor_28 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (not (= (select v_DerPreprocessor_28 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse11)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_27) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)))) .cse12) (or .cse9 (forall ((v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (select v_DerPreprocessor_26 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse13 (select v_DerPreprocessor_26 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (not (= .cse13 (select v_DerPreprocessor_26 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= .cse13 (select v_DerPreprocessor_26 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))))))))) (or .cse0 (and (or (forall ((v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse14 (select v_DerPreprocessor_32 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse14)) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse14))))) .cse9) (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse19 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse16 (select .cse19 |c_~#value~0.base|))) (let ((.cse18 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse17 (select .cse16 |c_~#value~0.offset|))) (or (not (= (select .cse16 .cse3) .cse17)) (not (= .cse18 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse18 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (= (select (select .cse19 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= (select .cse16 .cse7) .cse17)) (not (= .cse16 v_DerPreprocessor_33)) (not (= .cse18 (select v_DerPreprocessor_34 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select .cse16 .cse6) .cse17))))))))) (or .cse10 (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_23 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse20) 0) (not (= .cse21 (select v_DerPreprocessor_23 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse21 (select v_DerPreprocessor_23 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse21 (select v_DerPreprocessor_23 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))))) .cse9) (or .cse12 (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse22 (select v_DerPreprocessor_25 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse22 (select v_DerPreprocessor_25 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (not (= .cse22 (select v_DerPreprocessor_25 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse22 (select v_DerPreprocessor_25 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse20) 0))))))) (or .cse10 (and (or .cse12 (forall ((v_DerPreprocessor_37 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse23 (select v_DerPreprocessor_37 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse23 (select v_DerPreprocessor_37 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (not (= .cse23 (select v_DerPreprocessor_37 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_36) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= (select v_DerPreprocessor_37 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse23)))))) (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse24 (select v_DerPreprocessor_35 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (not (= .cse24 (select v_DerPreprocessor_35 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_35) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= .cse24 (select v_DerPreprocessor_35 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (not (= .cse24 (select v_DerPreprocessor_35 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3))))))) .cse9))) (or (and (or (forall ((v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse25 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse25 (select v_DerPreprocessor_22 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (= (select (select (store |c_#race| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse20) 0) (not (= .cse25 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse25 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2))))))) .cse9) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse29 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_20) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (let ((.cse27 (select .cse29 |c_~#value~0.base|))) (let ((.cse28 (select .cse27 |c_~#value~0.offset|)) (.cse26 (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse26)) (not (= v_DerPreprocessor_20 .cse27)) (not (= .cse28 (select .cse27 .cse3))) (= (select (select .cse29 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse20) 0) (not (= (select .cse27 .cse7) .cse28)) (not (= .cse28 (select .cse27 .cse6))) (not (= (select v_DerPreprocessor_21 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse26)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse26)))))))) .cse0)))) is different from false [2023-11-24 10:53:43,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse0 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse5 (+ 1 |c_~#value~0.offset|)) (.cse15 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse9 (+ 3 |c_~#value~0.offset|)) (.cse8 (+ 2 |c_~#value~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_2896 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse1 (select v_DerPreprocessor_22 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse1 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse1 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_2896) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_29) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse4 (select .cse7 |c_~#value~0.base|))) (let ((.cse3 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse6 (select .cse4 |c_~#value~0.offset|))) (or (not (= .cse3 (select v_DerPreprocessor_30 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select .cse4 .cse5) .cse6)) (not (= .cse4 v_DerPreprocessor_29)) (= (select (select .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= (select .cse4 .cse8) .cse6)) (not (= (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse3)) (not (= .cse3 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse6 (select .cse4 .cse9)))))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse10)) (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse10)) (not (= (select v_DerPreprocessor_31 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse10)) (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_2896) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)))) .cse0) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_20) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (let ((.cse12 (select .cse14 |c_~#value~0.base|))) (let ((.cse13 (select .cse12 |c_~#value~0.offset|)) (.cse11 (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse11)) (not (= v_DerPreprocessor_20 .cse12)) (not (= .cse13 (select .cse12 .cse5))) (= (select (select .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= (select .cse12 .cse9) .cse13)) (not (= .cse13 (select .cse12 .cse8))) (not (= (select v_DerPreprocessor_21 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse11)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse11))))))) (or (forall ((v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (select (select (store (store |c_#race| |c_~#value~0.base| v_ArrVal_2896) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= .cse16 (select v_DerPreprocessor_32 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse16)) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse16))))) .cse0) (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse20 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (select .cse20 |c_~#value~0.base|))) (let ((.cse19 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse18 (select .cse17 |c_~#value~0.offset|))) (or (not (= (select .cse17 .cse5) .cse18)) (not (= .cse19 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse19 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (= (select (select .cse20 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= (select .cse17 .cse9) .cse18)) (not (= .cse17 v_DerPreprocessor_33)) (not (= .cse19 (select v_DerPreprocessor_34 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select .cse17 .cse8) .cse18))))))))) is different from false [2023-11-24 10:53:44,990 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2895 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |c_~#value~0.base|) 0)))) (.cse10 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse2 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse7 (+ 3 |c_~#value~0.offset|)) (.cse6 (+ 1 |c_~#value~0.offset|)) (.cse8 (+ 2 |c_~#value~0.offset|))) (and (or .cse0 (forall ((v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse1 (select v_DerPreprocessor_32 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (= (select (select (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_32) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse1)) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse1)))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_29) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_30))) (let ((.cse5 (select .cse9 |c_~#value~0.base|))) (let ((.cse4 (select .cse5 |c_~#value~0.offset|)) (.cse3 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse3 (select v_DerPreprocessor_30 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse4 (select .cse5 .cse6))) (not (= (select .cse5 .cse7) .cse4)) (not (= (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse3)) (not (= .cse4 (select .cse5 .cse8))) (= (select (select .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= .cse3 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse5 v_DerPreprocessor_29))))))))) (or .cse0 (forall ((v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse11 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (select (select (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse10) 0) (not (= .cse11 (select v_DerPreprocessor_22 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse11 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse11 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse12)) (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse12)) (not (= (select v_DerPreprocessor_31 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse12)) (= (select (select (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)))) .cse0) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_20) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_21))) (let ((.cse14 (select .cse16 |c_~#value~0.base|))) (let ((.cse15 (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse13 (select .cse14 |c_~#value~0.offset|))) (or (not (= .cse13 (select .cse14 .cse6))) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse15)) (not (= .cse13 (select .cse14 .cse7))) (= (select (select .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse10) 0) (not (= (select v_DerPreprocessor_21 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse15)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse15)) (not (= .cse13 (select .cse14 .cse8))) (not (= v_DerPreprocessor_20 .cse14))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse17 (store (store |c_#race| |c_~#value~0.base| v_DerPreprocessor_33) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_34))) (let ((.cse19 (select .cse17 |c_~#value~0.base|))) (let ((.cse20 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse18 (select .cse19 |c_~#value~0.offset|))) (or (= (select (select .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= .cse18 (select .cse19 .cse7))) (not (= .cse20 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= v_DerPreprocessor_33 .cse19)) (not (= .cse20 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= (select .cse19 .cse6) .cse18)) (not (= .cse20 (select v_DerPreprocessor_34 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse18 (select .cse19 .cse8)))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))))) is different from false [2023-11-24 10:53:45,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|))) (let ((.cse15 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse6 (+ 1 |c_~#value~0.offset|)) (.cse2 (+ 2 |c_~#value~0.offset|)) (.cse5 (+ 3 |c_~#value~0.offset|)) (.cse10 (forall ((v_ArrVal_2895 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |c_~#value~0.base|) 0)))) (.cse7 (store |c_#race| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select |c_#race| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse9 0)))) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store .cse7 |c_~#value~0.base| v_DerPreprocessor_29) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_30))) (let ((.cse1 (select .cse4 |c_~#value~0.base|))) (let ((.cse3 (select .cse1 |c_~#value~0.offset|)) (.cse0 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse0 (select v_DerPreprocessor_30 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select .cse1 .cse2) .cse3)) (= 0 (select (select .cse4 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (not (= .cse3 (select .cse1 .cse5))) (not (= .cse1 v_DerPreprocessor_29)) (not (= (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse0)) (not (= (select .cse1 .cse6) .cse3)) (not (= .cse0 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2))))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))) (or (forall ((v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse8 (select v_DerPreprocessor_32 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse8)) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse8)) (= (select (select (store .cse7 |c_~#value~0.base| v_DerPreprocessor_32) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse9) 0)))) .cse10) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store .cse7 |c_~#value~0.base| v_DerPreprocessor_20) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_21))) (let ((.cse11 (select .cse14 |c_~#value~0.base|))) (let ((.cse12 (select .cse11 |c_~#value~0.offset|)) (.cse13 (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select .cse11 .cse2) .cse12)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse13)) (not (= (select .cse11 .cse6) .cse12)) (not (= (select v_DerPreprocessor_21 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse13)) (= (select (select .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= .cse12 (select .cse11 .cse5))) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse13)) (not (= v_DerPreprocessor_20 .cse11))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))) (or .cse10 (forall ((v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse16 (select v_DerPreprocessor_22 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (= (select (select (store .cse7 |c_~#value~0.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse15) 0) (not (= .cse16 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse16 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse20 (store (store .cse7 |c_~#value~0.base| v_DerPreprocessor_33) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_34))) (let ((.cse17 (select .cse20 |c_~#value~0.base|))) (let ((.cse18 (select .cse17 |c_~#value~0.offset|)) (.cse19 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select .cse17 .cse6) .cse18)) (not (= .cse18 (select .cse17 .cse2))) (not (= .cse19 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse19 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse18 (select .cse17 .cse5))) (= (select (select .cse20 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse9) 0) (not (= .cse19 (select v_DerPreprocessor_34 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= v_DerPreprocessor_33 .cse17))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))) (or .cse10 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse21)) (= (select (select (store .cse7 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse21)) (not (= (select v_DerPreprocessor_31 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse21))))))))) is different from false [2023-11-24 10:53:47,472 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) (.cse16 (+ 2 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|))) (let ((.cse8 (+ 3 |c_~#value~0.offset|)) (.cse7 (+ 1 |c_~#value~0.offset|)) (.cse10 (+ 2 |c_~#value~0.offset|)) (.cse3 (forall ((v_ArrVal_2895 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |c_~#value~0.base|) 0)))) (.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (store (select |c_#race| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2 0) .cse16 0)))) (and (or (forall ((v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse0 (select v_DerPreprocessor_22 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse0 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse0 (select v_DerPreprocessor_22 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (= (select (select (store .cse1 |c_~#value~0.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0)))) .cse3) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store (store .cse1 |c_~#value~0.base| v_DerPreprocessor_29) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_30))) (let ((.cse6 (select .cse9 |c_~#value~0.base|))) (let ((.cse5 (select .cse6 |c_~#value~0.offset|)) (.cse4 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse4 (select v_DerPreprocessor_30 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse5 (select .cse6 .cse7))) (not (= .cse6 v_DerPreprocessor_29)) (not (= (select .cse6 .cse8) .cse5)) (not (= (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse4)) (= (select (select .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0) (not (= (select .cse6 .cse10) .cse5)) (not (= .cse4 (select v_DerPreprocessor_30 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2))))))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store .cse1 |c_~#value~0.base| v_DerPreprocessor_20) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_21))) (let ((.cse11 (select .cse14 |c_~#value~0.base|))) (let ((.cse13 (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse12 (select .cse11 |c_~#value~0.offset|))) (or (not (= (select .cse11 .cse7) .cse12)) (not (= v_DerPreprocessor_20 .cse11)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse13)) (not (= (select .cse11 .cse8) .cse12)) (not (= (select v_DerPreprocessor_21 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse13)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse13)) (= (select (select .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse2) 0) (not (= .cse12 (select .cse11 .cse10)))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))) (or (forall ((v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse15 (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= .cse15 (select v_DerPreprocessor_32 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (= (select (select (store .cse1 |c_~#value~0.base| v_DerPreprocessor_32) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse16) 0) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse15)) (not (= (select v_DerPreprocessor_32 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse15))))) .cse3) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| Int) (v_ArrVal_2895 Int)) (or (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse20 (store (store .cse1 |c_~#value~0.base| v_DerPreprocessor_33) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41| v_DerPreprocessor_34))) (let ((.cse17 (select .cse20 |c_~#value~0.base|))) (let ((.cse18 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (.cse19 (select .cse17 |c_~#value~0.offset|))) (or (not (= v_DerPreprocessor_33 .cse17)) (not (= .cse18 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)))) (not (= .cse19 (select .cse17 .cse8))) (= (select (select .cse20 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) .cse16) 0) (not (= (select .cse17 .cse7) .cse19)) (not (= .cse18 (select v_DerPreprocessor_34 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)))) (not (= .cse18 (select v_DerPreprocessor_34 |thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (not (= .cse19 (select .cse17 .cse10)))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_2895) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_41|) 0)))) (or .cse3 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 3)) .cse21)) (not (= (select v_DerPreprocessor_31 (+ |thr1Thread2of3ForFork0_~#casret~0#1.offset| 2)) .cse21)) (not (= (select v_DerPreprocessor_31 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) .cse21)) (= (select (select (store .cse1 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)))))))) is different from false [2023-11-24 10:53:47,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:47,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 250 treesize of output 134 [2023-11-24 10:53:47,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:47,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 169 [2023-11-24 10:53:47,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:47,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 75 [2023-11-24 10:53:47,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:47,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 94 treesize of output 274 [2023-11-24 10:53:48,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:48,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 132 [2023-11-24 10:53:48,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:48,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 221 [2023-11-24 10:53:48,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:48,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 64 [2023-11-24 10:53:48,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:48,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 108 treesize of output 292 [2023-11-24 10:53:49,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2023-11-24 10:53:49,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 30 [2023-11-24 10:53:49,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 54 [2023-11-24 10:53:49,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 250 treesize of output 134 [2023-11-24 10:53:49,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 233 [2023-11-24 10:53:49,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 64 [2023-11-24 10:53:49,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:49,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 292 [2023-11-24 10:53:51,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:51,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2023-11-24 10:53:51,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:51,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 32 [2023-11-24 10:53:51,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:51,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 54 [2023-11-24 10:53:51,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2023-11-24 10:53:51,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:51,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 32 [2023-11-24 10:53:51,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:53:51,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 54 [2023-11-24 10:53:51,574 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2023-11-24 10:53:51,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 66 [2023-11-24 10:53:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 166 proven. 147 refuted. 0 times theorem prover too weak. 227 trivial. 18 not checked. [2023-11-24 10:53:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941510682] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 10:53:52,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 10:53:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2023-11-24 10:53:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081261176] [2023-11-24 10:53:52,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 10:53:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-24 10:53:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:53:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-24 10:53:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1078, Unknown=9, NotChecked=360, Total=1640 [2023-11-24 10:53:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:53:52,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:53:52,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.05) internal successors, (282), 41 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:53:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:53:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:53:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2023-11-24 10:53:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-11-24 10:53:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:53:54,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:53:56,690 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] [2023-11-24 10:54:02,780 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] [2023-11-24 10:54:04,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:54:06,821 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] [2023-11-24 10:54:08,837 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] [2023-11-24 10:54:10,858 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] [2023-11-24 10:54:12,870 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] [2023-11-24 10:54:18,968 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] [2023-11-24 10:54:20,985 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] [2023-11-24 10:54:23,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:54:25,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:54:27,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:29,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:31,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:33,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:35,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:37,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:39,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:41,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 10:54:52,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:54:54,891 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] [2023-11-24 10:55:01,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:03,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:16,014 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] [2023-11-24 10:55:18,032 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] [2023-11-24 10:55:20,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:22,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:24,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:26,180 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] [2023-11-24 10:55:28,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:30,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 10:55:32,820 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] [2023-11-24 10:55:34,842 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] Killed by 15