./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b03bd7cf 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 18:09:29,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 18:09:29,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-28 18:09:29,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 18:09:29,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 18:09:29,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 18:09:29,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 18:09:29,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 18:09:29,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 18:09:29,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 18:09:29,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 18:09:29,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 18:09:29,823 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 18:09:29,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 18:09:29,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 18:09:29,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 18:09:29,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 18:09:29,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 18:09:29,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 18:09:29,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 18:09:29,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 18:09:29,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 18:09:29,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 18:09:29,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 18:09:29,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 18:09:29,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 18:09:29,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 18:09:29,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 18:09:29,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 18:09:29,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 18:09:29,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 18:09:29,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 18:09:29,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 18:09:29,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 18:09:29,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 18:09:29,832 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 18:09:29,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 18:09:29,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 18:09:29,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 18:09:29,835 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 18:09:29,835 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 18:09:29,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 [2024-10-28 18:09:30,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 18:09:30,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 18:09:30,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 18:09:30,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 18:09:30,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 18:09:30,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2024-10-28 18:09:31,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 18:09:31,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 18:09:31,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2024-10-28 18:09:31,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be953c5dd/865d2533765c4aaa8646fe93afc3b29f/FLAG35bd26398 [2024-10-28 18:09:31,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be953c5dd/865d2533765c4aaa8646fe93afc3b29f [2024-10-28 18:09:31,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 18:09:31,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 18:09:31,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 18:09:31,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 18:09:31,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 18:09:31,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 06:09:31" (1/1) ... [2024-10-28 18:09:31,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b12254d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:31, skipping insertion in model container [2024-10-28 18:09:31,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 06:09:31" (1/1) ... [2024-10-28 18:09:32,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 18:09:32,485 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2024-10-28 18:09:32,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 18:09:32,568 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 18:09:32,607 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2024-10-28 18:09:32,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 18:09:32,673 INFO L204 MainTranslator]: Completed translation [2024-10-28 18:09:32,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32 WrapperNode [2024-10-28 18:09:32,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 18:09:32,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 18:09:32,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 18:09:32,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 18:09:32,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,728 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 272 [2024-10-28 18:09:32,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 18:09:32,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 18:09:32,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 18:09:32,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 18:09:32,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 18:09:32,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 18:09:32,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 18:09:32,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 18:09:32,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (1/1) ... [2024-10-28 18:09:32,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 18:09:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:32,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-28 18:09:32,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-28 18:09:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-28 18:09:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-28 18:09:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-28 18:09:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-28 18:09:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-28 18:09:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-28 18:09:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 18:09:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-28 18:09:32,863 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-28 18:09:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 18:09:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 18:09:32,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 18:09:32,866 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 18:09:32,990 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 18:09:32,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 18:09:33,346 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 18:09:33,346 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 18:09:33,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 18:09:33,899 INFO L316 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-28 18:09:33,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 06:09:33 BoogieIcfgContainer [2024-10-28 18:09:33,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 18:09:33,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 18:09:33,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 18:09:33,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 18:09:33,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 06:09:31" (1/3) ... [2024-10-28 18:09:33,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2320d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 06:09:33, skipping insertion in model container [2024-10-28 18:09:33,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:09:32" (2/3) ... [2024-10-28 18:09:33,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2320d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 06:09:33, skipping insertion in model container [2024-10-28 18:09:33,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 06:09:33" (3/3) ... [2024-10-28 18:09:33,914 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2024-10-28 18:09:33,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 18:09:33,932 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-28 18:09:33,932 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 18:09:33,979 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-28 18:09:34,038 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:09:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 18:09:34,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:34,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-28 18:09:34,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-28 18:09:34,071 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:09:34,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-28 18:09:34,089 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55b12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:09:34,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:09:34,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1974830970, now seen corresponding path program 1 times [2024-10-28 18:09:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572688621] [2024-10-28 18:09:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-28 18:09:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572688621] [2024-10-28 18:09:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572688621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:09:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:09:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:09:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545512303] [2024-10-28 18:09:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:09:35,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:09:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:09:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:09:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:35,191 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:35,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:35,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:37,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-28 18:09:37,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:37,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2129310501, now seen corresponding path program 1 times [2024-10-28 18:09:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:37,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512219220] [2024-10-28 18:09:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:37,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512219220] [2024-10-28 18:09:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512219220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168022562] [2024-10-28 18:09:37,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:37,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:37,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-28 18:09:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:37,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:09:37,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:37,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:37,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168022562] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:37,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:37,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:09:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671509346] [2024-10-28 18:09:37,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:09:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:09:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:09:37,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:37,934 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:37,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:37,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:38,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-28 18:09:38,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-28 18:09:38,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash -149208161, now seen corresponding path program 2 times [2024-10-28 18:09:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715651752] [2024-10-28 18:09:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:38,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:38,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715651752] [2024-10-28 18:09:38,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715651752] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:38,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544079741] [2024-10-28 18:09:38,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:09:38,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:38,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:38,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:38,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-28 18:09:38,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:09:38,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:09:38,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:09:38,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:38,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544079741] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:38,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:09:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567498532] [2024-10-28 18:09:38,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:38,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:09:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:09:38,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:09:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:38,670 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:38,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:38,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:38,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:38,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:38,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-28 18:09:38,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:38,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash -573245985, now seen corresponding path program 3 times [2024-10-28 18:09:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680019427] [2024-10-28 18:09:38,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:09:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:40,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680019427] [2024-10-28 18:09:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680019427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518381775] [2024-10-28 18:09:40,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:09:40,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:40,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:40,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-28 18:09:40,473 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 18:09:40,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:09:40,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-28 18:09:40,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:40,952 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:09:40,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:09:41,020 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 79 treesize of output 56 [2024-10-28 18:09:41,472 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 79 treesize of output 56 [2024-10-28 18:09:41,705 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-28 18:09:41,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-28 18:09:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-28 18:09:41,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-28 18:09:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518381775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:42,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:42,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2024-10-28 18:09:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532213423] [2024-10-28 18:09:42,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:42,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-28 18:09:42,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:42,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-28 18:09:42,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=190, Unknown=4, NotChecked=0, Total=240 [2024-10-28 18:09:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:42,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:42,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:42,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:42,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:42,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:42,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 18:09:43,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-28 18:09:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:43,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1225207394, now seen corresponding path program 1 times [2024-10-28 18:09:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648176716] [2024-10-28 18:09:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:09:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648176716] [2024-10-28 18:09:43,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648176716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409317325] [2024-10-28 18:09:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:43,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:43,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:43,637 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) [2024-10-28 18:09:43,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-28 18:09:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:43,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:09:43,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:09:43,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:09:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409317325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:43,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-28 18:09:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604781985] [2024-10-28 18:09:43,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:43,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:09:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:09:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:09:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:43,816 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:43,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:43,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:43,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-28 18:09:43,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 18:09:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 18:09:44,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 18:09:44,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-28 18:09:44,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:44,340 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-10-28 18:09:44,341 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-28 18:09:44,345 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:09:44,345 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:09:44,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:09:44,346 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55b12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:09:44,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:09:44,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:09:44,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1690550556, now seen corresponding path program 1 times [2024-10-28 18:09:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:44,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732841275] [2024-10-28 18:09:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:44,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732841275] [2024-10-28 18:09:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732841275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:09:44,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:09:44,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:09:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289643522] [2024-10-28 18:09:44,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:09:44,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:09:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:09:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:09:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:44,384 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:44,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:44,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-28 18:09:44,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:09:44,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2131028665, now seen corresponding path program 1 times [2024-10-28 18:09:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074370783] [2024-10-28 18:09:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074370783] [2024-10-28 18:09:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074370783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270945848] [2024-10-28 18:09:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:44,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:44,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-28 18:09:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:44,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:09:44,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:44,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270945848] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:44,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:09:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806209803] [2024-10-28 18:09:44,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:44,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:09:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:09:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:09:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:44,592 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:44,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:44,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:44,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:44,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-28 18:09:44,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:44,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:09:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1246443469, now seen corresponding path program 2 times [2024-10-28 18:09:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494267445] [2024-10-28 18:09:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494267445] [2024-10-28 18:09:44,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494267445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732394662] [2024-10-28 18:09:44,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:09:44,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:44,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:44,908 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:44,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-28 18:09:45,011 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:09:45,012 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:09:45,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:09:45,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:45,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:09:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732394662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:45,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:45,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:09:45,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115554583] [2024-10-28 18:09:45,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:45,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:09:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:45,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:09:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:09:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:45,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:45,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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) [2024-10-28 18:09:45,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:45,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-28 18:09:45,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-28 18:09:45,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:09:45,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -543057293, now seen corresponding path program 3 times [2024-10-28 18:09:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:45,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079723732] [2024-10-28 18:09:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:45,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:09:45,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:09:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:09:45,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:09:45,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:09:45,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:09:45,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:09:45,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-28 18:09:45,389 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:09:45,390 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-28 18:09:45,390 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:09:45,390 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-28 18:09:45,416 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-28 18:09:45,422 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:09:45,423 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:09:45,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-28 18:09:45,425 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55b12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:09:45,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:09:47,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:47,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash -117734180, now seen corresponding path program 1 times [2024-10-28 18:09:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122840461] [2024-10-28 18:09:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 18:09:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122840461] [2024-10-28 18:09:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122840461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:09:47,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:09:47,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:09:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886456803] [2024-10-28 18:09:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:09:47,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:09:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:09:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:09:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:47,329 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:47,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-28 18:09:54,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1065484084, now seen corresponding path program 1 times [2024-10-28 18:09:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686135159] [2024-10-28 18:09:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:09:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686135159] [2024-10-28 18:09:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686135159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817304122] [2024-10-28 18:09:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:54,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:54,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:54,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:54,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-28 18:09:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:54,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:09:54,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:09:54,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:09:54,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817304122] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:54,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:54,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:09:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155857609] [2024-10-28 18:09:54,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:09:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:09:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:09:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:54,974 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:54,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:54,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:54,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:55,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-28 18:09:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:55,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -707119066, now seen corresponding path program 2 times [2024-10-28 18:09:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711179114] [2024-10-28 18:09:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:09:56,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711179114] [2024-10-28 18:09:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711179114] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385961787] [2024-10-28 18:09:56,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:09:56,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:56,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:56,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:56,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-28 18:09:56,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:09:56,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:09:56,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:09:56,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:09:56,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:09:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:09:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385961787] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:09:56,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:09:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:09:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784752842] [2024-10-28 18:09:56,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:09:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:09:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:09:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:09:56,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:09:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:56,211 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:09:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:09:56,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:56,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:56,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:09:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:09:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:09:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:09:57,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-28 18:09:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:57,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:09:57,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:09:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1834433894, now seen corresponding path program 3 times [2024-10-28 18:09:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:09:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507346728] [2024-10-28 18:09:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:09:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:09:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:09:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:09:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:09:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507346728] [2024-10-28 18:09:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507346728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:09:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690241374] [2024-10-28 18:09:58,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:09:58,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:09:58,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:09:58,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:09:58,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-28 18:09:59,030 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 18:09:59,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:09:59,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-28 18:09:59,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:09:59,407 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:09:59,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:09:59,460 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 79 treesize of output 56 [2024-10-28 18:09:59,779 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 79 treesize of output 56 [2024-10-28 18:10:00,071 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-28 18:10:00,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-28 18:10:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-28 18:10:00,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:10:00,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:10:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 2 not checked. [2024-10-28 18:10:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690241374] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:10:00,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:10:00,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-28 18:10:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010881773] [2024-10-28 18:10:00,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:10:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-28 18:10:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:10:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-28 18:10:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-10-28 18:10:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:00,428 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:10:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:10:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:03,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-28 18:10:03,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-28 18:10:03,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:10:03,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:10:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash -247776335, now seen corresponding path program 1 times [2024-10-28 18:10:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:10:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534148902] [2024-10-28 18:10:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:10:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-28 18:10:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:10:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534148902] [2024-10-28 18:10:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534148902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:10:03,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:10:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 18:10:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501037377] [2024-10-28 18:10:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:10:03,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:10:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:10:03,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:10:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:10:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:03,726 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:10:03,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:10:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:05,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-28 18:10:05,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:10:05,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:10:05,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1366610943, now seen corresponding path program 1 times [2024-10-28 18:10:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:10:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428904208] [2024-10-28 18:10:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:10:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:10:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:10:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428904208] [2024-10-28 18:10:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428904208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:10:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070001361] [2024-10-28 18:10:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:08,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:10:08,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:10:08,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:10:08,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-28 18:10:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:08,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-28 18:10:08,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:10:09,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:10:09,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:10:09,885 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 79 treesize of output 56 [2024-10-28 18:10:10,083 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 18:10:10,395 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 79 treesize of output 56 [2024-10-28 18:10:10,575 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:10:10,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-28 18:10:10,819 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 79 treesize of output 56 [2024-10-28 18:10:11,195 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:10:11,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-28 18:10:13,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:10:13,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 553 treesize of output 361 [2024-10-28 18:10:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:10:14,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:10:14,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:10:15,159 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 12 [2024-10-28 18:10:15,171 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_562 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (or (forall ((v_ArrVal_562 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2024-10-28 18:10:15,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_11| Int) (v_ArrVal_562 (Array Int Int))) (or (< 9 |v_t_funThread1of2ForFork0_~i~0#1_11|) (< |v_t_funThread1of2ForFork0_~i~0#1_11| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_11| 28))) 0))) is different from false [2024-10-28 18:10:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-10-28 18:10:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070001361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:10:15,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:10:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 10] total 36 [2024-10-28 18:10:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764758483] [2024-10-28 18:10:15,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:10:15,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-28 18:10:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:10:15,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-28 18:10:15,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=999, Unknown=3, NotChecked=198, Total=1332 [2024-10-28 18:10:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:15,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:10:15,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:10:15,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:15,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:15,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:15,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:15,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:15,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 18:10:25,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-28 18:10:25,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:10:25,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:10:25,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:10:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 422182801, now seen corresponding path program 1 times [2024-10-28 18:10:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:10:25,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073429689] [2024-10-28 18:10:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:10:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:10:25,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:10:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073429689] [2024-10-28 18:10:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073429689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:10:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094708361] [2024-10-28 18:10:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:25,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:10:25,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:10:25,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:10:25,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-28 18:10:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:25,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 18:10:25,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:10:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:10:25,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:10:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:10:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094708361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:10:25,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:10:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-28 18:10:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667395922] [2024-10-28 18:10:25,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:10:25,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 18:10:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:10:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 18:10:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-28 18:10:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:25,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:10:25,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 18:10:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 18:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:10:27,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-28 18:10:27,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-28 18:10:27,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:10:27,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:10:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 993901123, now seen corresponding path program 1 times [2024-10-28 18:10:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:10:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476161082] [2024-10-28 18:10:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:10:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:10:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:10:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476161082] [2024-10-28 18:10:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476161082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:10:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18724150] [2024-10-28 18:10:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:30,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:10:30,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:10:30,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:10:30,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-28 18:10:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:30,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-28 18:10:30,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:10:31,629 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:10:31,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:10:31,723 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 86 treesize of output 61 [2024-10-28 18:10:31,966 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 86 treesize of output 61 [2024-10-28 18:10:32,136 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 18:10:32,423 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 86 treesize of output 61 [2024-10-28 18:10:32,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:10:32,603 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 18 treesize of output 13 [2024-10-28 18:10:32,910 INFO L349 Elim1Store]: treesize reduction 154, result has 57.7 percent of original size [2024-10-28 18:10:32,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 55 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 95 treesize of output 252 [2024-10-28 18:10:33,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:10:33,280 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 18 treesize of output 13 [2024-10-28 18:10:33,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:10:33,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-28 18:10:34,887 INFO L349 Elim1Store]: treesize reduction 176, result has 40.9 percent of original size [2024-10-28 18:10:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 56 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 11 case distinctions, treesize of input 269 treesize of output 287 [2024-10-28 18:10:39,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:10:39,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 10 case distinctions, treesize of input 554 treesize of output 362 [2024-10-28 18:10:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:10:39,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:10:40,201 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_770 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_770) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_772))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-10-28 18:10:40,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:10:40,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 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-28 18:10:40,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:10:40,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-10-28 18:10:40,242 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 22 treesize of output 18 [2024-10-28 18:10:40,452 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_15| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_15| 0) (forall ((v_ArrVal_767 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0)) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_15|))) (or (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_15| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_15| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_772) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_15|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-28 18:10:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-10-28 18:10:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18724150] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:10:40,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:10:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 11] total 40 [2024-10-28 18:10:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655644457] [2024-10-28 18:10:40,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:10:40,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-28 18:10:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:10:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-28 18:10:40,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1307, Unknown=27, NotChecked=150, Total=1640 [2024-10-28 18:10:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:40,845 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:10:40,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:10:40,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:10:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:10:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-28 18:10:47,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-28 18:10:48,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-28 18:10:48,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:10:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:10:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash -803001141, now seen corresponding path program 2 times [2024-10-28 18:10:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:10:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179658241] [2024-10-28 18:10:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:10:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:10:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:10:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:10:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:10:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179658241] [2024-10-28 18:10:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179658241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:10:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214423764] [2024-10-28 18:10:50,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:10:50,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:10:50,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:10:50,903 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:10:50,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-28 18:10:51,129 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:10:51,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:10:51,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-10-28 18:10:51,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:10:51,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:10:51,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:10:51,950 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 79 treesize of output 56 [2024-10-28 18:10:52,144 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 79 treesize of output 56 [2024-10-28 18:10:52,352 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 18:10:52,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:10:52,716 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 18 treesize of output 13 [2024-10-28 18:10:52,899 INFO L349 Elim1Store]: treesize reduction 217, result has 34.4 percent of original size [2024-10-28 18:10:52,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 153 [2024-10-28 18:10:53,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:10:53,188 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 18 treesize of output 13 [2024-10-28 18:10:53,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:10:53,423 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 18 treesize of output 13 [2024-10-28 18:10:53,683 INFO L349 Elim1Store]: treesize reduction 180, result has 51.5 percent of original size [2024-10-28 18:10:53,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 139 treesize of output 264 [2024-10-28 18:10:54,410 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 484 treesize of output 373 [2024-10-28 18:10:55,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:10:55,398 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 484 treesize of output 461 [2024-10-28 18:10:55,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:10:55,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 485 treesize of output 519 [2024-10-28 18:11:05,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:11:05,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1040 treesize of output 588 [2024-10-28 18:11:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:11:07,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:07,977 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_879 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_879) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-10-28 18:11:08,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:11:08,103 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 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-28 18:11:08,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:11:08,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-10-28 18:11:08,115 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 22 treesize of output 18 [2024-10-28 18:11:08,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse2 (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))))) (and (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (or (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 .cse0 v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|)))) (or (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse2) (or .cse2 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2024-10-28 18:11:08,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))))) (and (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) .cse1 v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|)))) (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) is different from false [2024-10-28 18:11:08,338 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_17| 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_17|) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int)) (or (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_17| |v_t_funThread1of2ForFork0_~i~0#1_17|) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))) (< |v_t_funThread1of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_17|)))) is different from false [2024-10-28 18:11:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-28 18:11:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214423764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:09,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:09,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 12] total 44 [2024-10-28 18:11:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011541465] [2024-10-28 18:11:09,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:09,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-28 18:11:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:09,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-28 18:11:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1440, Unknown=22, NotChecked=324, Total=1980 [2024-10-28 18:11:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:09,031 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:09,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8) internal successors, (126), 44 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:09,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:09,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:09,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:09,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:11:09,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:09,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 18:11:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:11:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-28 18:11:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 18:11:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:11:15,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 18:11:15,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-28 18:11:15,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-28 18:11:15,937 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-28 18:11:15,937 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-28 18:11:15,939 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:15,940 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:11:15,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:11:15,941 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55b12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:15,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:11:15,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:15,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -219783028, now seen corresponding path program 1 times [2024-10-28 18:11:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099952811] [2024-10-28 18:11:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099952811] [2024-10-28 18:11:15,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099952811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:15,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:11:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390206411] [2024-10-28 18:11:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:15,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:15,976 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:15,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:15,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-28 18:11:16,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1459804062, now seen corresponding path program 1 times [2024-10-28 18:11:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619079258] [2024-10-28 18:11:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619079258] [2024-10-28 18:11:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619079258] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937054771] [2024-10-28 18:11:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:16,048 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:16,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-28 18:11:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:16,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:16,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:16,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937054771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:16,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:11:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115804829] [2024-10-28 18:11:16,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:16,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:16,196 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:16,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:16,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:16,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:16,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-28 18:11:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:16,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -575926864, now seen corresponding path program 2 times [2024-10-28 18:11:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090139161] [2024-10-28 18:11:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090139161] [2024-10-28 18:11:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090139161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899984350] [2024-10-28 18:11:16,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:11:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:16,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:16,507 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:16,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-28 18:11:16,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:11:16,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:16,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:11:16,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:16,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:11:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899984350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:16,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:11:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243033359] [2024-10-28 18:11:16,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:11:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:11:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:11:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:16,708 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:16,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:16,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:16,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:16,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:16,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-28 18:11:16,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-28 18:11:16,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:16,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 902803568, now seen corresponding path program 3 times [2024-10-28 18:11:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900682614] [2024-10-28 18:11:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:11:16,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:11:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:11:16,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:11:16,994 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:11:16,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:11:16,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:11:16,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-28 18:11:16,996 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:11:16,997 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-28 18:11:16,997 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:11:16,997 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-28 18:11:17,029 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-28 18:11:17,033 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:17,037 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:11:17,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:11:17,037 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55b12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:17,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:11:17,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -960986124, now seen corresponding path program 1 times [2024-10-28 18:11:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:17,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847683276] [2024-10-28 18:11:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847683276] [2024-10-28 18:11:17,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847683276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:17,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:11:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492992261] [2024-10-28 18:11:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:17,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:17,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:17,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:17,830 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:17,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:17,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:18,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-28 18:11:18,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:18,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash 97974495, now seen corresponding path program 1 times [2024-10-28 18:11:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964157166] [2024-10-28 18:11:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964157166] [2024-10-28 18:11:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964157166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722299425] [2024-10-28 18:11:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:18,737 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:18,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-28 18:11:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:18,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:18,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:18,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722299425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:18,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:11:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438176038] [2024-10-28 18:11:18,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:18,926 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:18,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:18,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:18,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:18,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-28 18:11:19,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-28 18:11:19,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:19,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1874118272, now seen corresponding path program 2 times [2024-10-28 18:11:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826238606] [2024-10-28 18:11:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:19,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826238606] [2024-10-28 18:11:19,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826238606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651792215] [2024-10-28 18:11:19,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:11:19,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:19,253 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:19,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-28 18:11:19,399 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:11:19,399 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:19,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:11:19,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:19,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:11:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651792215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:19,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:11:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867048788] [2024-10-28 18:11:19,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:19,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:11:19,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:19,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:11:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:11:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:19,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:19,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:19,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:19,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:19,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:19,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-28 18:11:19,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-28 18:11:19,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:19,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1400088032, now seen corresponding path program 3 times [2024-10-28 18:11:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192326221] [2024-10-28 18:11:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:11:19,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:11:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:11:19,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:11:19,776 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:11:19,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:11:19,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:11:19,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-28 18:11:19,778 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:11:19,778 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-28 18:11:19,779 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:11:19,779 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-28 18:11:19,811 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-28 18:11:19,814 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:19,815 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:11:19,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-28 18:11:19,816 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55b12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:19,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:11:20,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 626551190, now seen corresponding path program 1 times [2024-10-28 18:11:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554264578] [2024-10-28 18:11:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-28 18:11:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554264578] [2024-10-28 18:11:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554264578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:20,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:20,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:11:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079907491] [2024-10-28 18:11:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:20,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:20,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:20,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,976 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:20,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:20,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:44,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-28 18:11:44,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:44,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1809594357, now seen corresponding path program 1 times [2024-10-28 18:11:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522531170] [2024-10-28 18:11:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:11:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522531170] [2024-10-28 18:11:44,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522531170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858602906] [2024-10-28 18:11:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:44,945 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:44,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-28 18:11:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:45,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:45,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:11:45,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:11:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858602906] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:45,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:11:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166553513] [2024-10-28 18:11:45,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:45,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:45,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:45,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:45,139 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:45,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:45,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:45,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:53,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-28 18:11:53,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-28 18:11:53,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:53,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 242927382, now seen corresponding path program 2 times [2024-10-28 18:11:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:53,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026722040] [2024-10-28 18:11:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:11:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026722040] [2024-10-28 18:11:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026722040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741991381] [2024-10-28 18:11:53,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:11:53,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:53,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:54,000 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:54,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-28 18:11:54,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:11:54,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:54,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:11:54,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:11:54,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:11:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741991381] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:54,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:54,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:11:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504497459] [2024-10-28 18:11:54,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:54,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:11:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:11:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:11:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:54,247 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:54,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:54,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:54,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:54,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:12:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:12:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:03,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-28 18:12:03,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-28 18:12:03,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:12:03,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:12:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1628555958, now seen corresponding path program 3 times [2024-10-28 18:12:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:12:03,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331545908] [2024-10-28 18:12:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:12:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:12:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:12:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:12:25,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:12:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331545908] [2024-10-28 18:12:25,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331545908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:12:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128416300] [2024-10-28 18:12:25,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:12:25,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:12:25,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:12:25,029 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:12:25,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-28 18:12:26,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-28 18:12:26,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:12:26,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-10-28 18:12:26,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:12:26,820 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-28 18:12:26,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:12:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:12:27,066 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 100 treesize of output 71 [2024-10-28 18:12:27,341 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-10-28 18:12:27,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 27 [2024-10-28 18:12:27,868 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 100 treesize of output 71 [2024-10-28 18:12:28,235 INFO L349 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2024-10-28 18:12:28,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 48 [2024-10-28 18:12:28,909 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 100 treesize of output 71 [2024-10-28 18:12:29,350 INFO L349 Elim1Store]: treesize reduction 56, result has 45.1 percent of original size [2024-10-28 18:12:29,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 71 [2024-10-28 18:12:29,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:29,915 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 53 treesize of output 42 [2024-10-28 18:12:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:30,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:30,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:30,204 INFO L349 Elim1Store]: treesize reduction 217, result has 34.4 percent of original size [2024-10-28 18:12:30,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 81 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 183 [2024-10-28 18:12:30,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:30,589 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 53 treesize of output 42 [2024-10-28 18:12:31,605 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 147 treesize of output 116 [2024-10-28 18:12:32,376 INFO L349 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2024-10-28 18:12:32,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 62 [2024-10-28 18:12:33,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:33,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:33,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:33,590 INFO L349 Elim1Store]: treesize reduction 120, result has 61.4 percent of original size [2024-10-28 18:12:33,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 82 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 150 treesize of output 301 [2024-10-28 18:12:34,643 INFO L349 Elim1Store]: treesize reduction 208, result has 40.9 percent of original size [2024-10-28 18:12:34,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 79 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 13 case distinctions, treesize of input 107 treesize of output 183 [2024-10-28 18:12:35,484 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 152 treesize of output 123 [2024-10-28 18:12:36,122 INFO L349 Elim1Store]: treesize reduction 208, result has 40.9 percent of original size [2024-10-28 18:12:36,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 79 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 13 case distinctions, treesize of input 159 treesize of output 235 [2024-10-28 18:12:43,126 INFO L349 Elim1Store]: treesize reduction 208, result has 40.9 percent of original size [2024-10-28 18:12:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 79 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 13 case distinctions, treesize of input 721 treesize of output 489 [2024-10-28 18:13:48,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:13:48,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:13:48,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:13:48,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:13:48,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 81 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 10 case distinctions, treesize of input 3995 treesize of output 2087 [2024-10-28 18:13:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-28 18:13:54,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:13:54,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:13:54,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:13:54,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:13:55,401 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2024-10-28 18:13:55,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse5)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse5)) 0))))) is different from false [2024-10-28 18:13:55,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse5)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse5)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0)))) is different from false [2024-10-28 18:14:00,958 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int) (|t_funThread2of4ForFork0_~p~0#1.base| Int)) (let ((.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (not (= (select (select (store (let ((.cse0 (store |c_#pthreadsMutex| |t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |t_funThread2of4ForFork0_~p~0#1.base|) (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1)))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1))) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse1)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (store (select (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3))) (store (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse2 |t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse1)) 0)))) is different from false [2024-10-28 18:14:03,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:14:03,236 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 104 treesize of output 85 [2024-10-28 18:14:03,294 INFO L349 Elim1Store]: treesize reduction 14, result has 67.4 percent of original size [2024-10-28 18:14:03,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2024-10-28 18:14:03,390 INFO L349 Elim1Store]: treesize reduction 57, result has 48.6 percent of original size [2024-10-28 18:14:03,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 106 [2024-10-28 18:14:03,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:14:03,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2024-10-28 18:14:03,433 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 37 treesize of output 30 [2024-10-28 18:14:03,510 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 4 [2024-10-28 18:14:03,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:14:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 108 [2024-10-28 18:14:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 44 refuted. 3 times theorem prover too weak. 21 trivial. 9 not checked. [2024-10-28 18:14:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128416300] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:09,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:09,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27, 28] total 71 [2024-10-28 18:14:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501448140] [2024-10-28 18:14:09,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:09,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-28 18:14:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-28 18:14:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=3637, Unknown=201, NotChecked=924, Total=5112 [2024-10-28 18:14:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,108 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:09,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.2083333333333335) internal successors, (231), 71 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:14:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:14:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:21,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:14:47,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse25 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse35 (select .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse35 1)))) (.cse0 (= (select .cse25 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse21 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse22 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse26 (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse35))) (.cse1 (select |c_#memory_int| 4)) (.cse23 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse24 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (= (select (store (select (let ((.cse5 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse3)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse1 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse9)) 0)) (= (select (store (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse10 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse10 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 56) 0)) (or (= (select .cse1 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= (select .cse1 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608))) (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (or (= (select .cse1 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 32) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse20 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse16 (let ((.cse18 (let ((.cse19 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse19 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse19 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse17 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse18))) (store (store .cse17 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse18) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse20)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse20)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse21 (or (= (select .cse1 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse1 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 60) 0)) (or (and .cse0 .cse21 .cse22 .cse23 .cse24) (and .cse21 (= (select (store .cse25 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse25 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse23 .cse24)) .cse22 (= (select .cse26 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse27 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse27)) 0)) (= (select (store (select (let ((.cse29 (let ((.cse30 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse28 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29))) (store (store .cse28 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse27)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse1 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse26))) (store (store .cse33 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse33 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse33 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 196) 0)) .cse23 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse24)))) is different from false [2024-10-28 18:15:23,088 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 295 DAG size of output: 239 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:15:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:15:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:15:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-28 18:15:26,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-28 18:15:26,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:15:26,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:15:26,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:15:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash 240461887, now seen corresponding path program 1 times [2024-10-28 18:15:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:15:26,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539830246] [2024-10-28 18:15:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:15:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:15:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:15:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-28 18:15:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:15:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539830246] [2024-10-28 18:15:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539830246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:15:26,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:15:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 18:15:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915442350] [2024-10-28 18:15:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:15:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:15:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:15:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:15:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:15:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:15:26,783 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:15:26,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:15:26,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:26,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:15:26,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:15:26,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-10-28 18:15:26,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:15:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:15:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:15:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-28 18:15:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-28 18:15:35,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:15:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:15:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1813811236, now seen corresponding path program 1 times [2024-10-28 18:15:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:15:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875460536] [2024-10-28 18:15:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:15:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:15:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:15:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:15:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:15:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875460536] [2024-10-28 18:15:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875460536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:15:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115232947] [2024-10-28 18:15:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:15:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:15:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:15:35,351 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:15:35,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-28 18:15:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:15:35,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:15:35,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:15:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:15:35,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:15:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:15:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115232947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:15:35,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:15:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-28 18:15:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78026500] [2024-10-28 18:15:35,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:15:35,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:15:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:15:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:15:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:15:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:15:35,770 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:15:35,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:15:35,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:35,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:15:35,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:15:35,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-10-28 18:15:35,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:35,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:15:37,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse13 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse15 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse0 (select |c_#memory_int| 4)) (.cse16 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse17 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (store (select (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse2)) 0)))) (<= 0 (+ 9 .cse7)) (or (= (select .cse0 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse8 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse8)) 0)) (= (select (store (select (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse9 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10))) (store (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse8)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 56) 0)) (or (= (select .cse0 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (or (= (select .cse0 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse7 0) (or (= (select .cse0 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 32) 0)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse13 (or (= (select .cse0 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse0 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 60) 0)) (let ((.cse14 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (or (and (= (select .cse14 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse13 .cse15 .cse16 .cse17) (and .cse13 (= (select (store .cse14 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse14 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse16 .cse17))) .cse15 (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse18 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse18)) 0)) (= (select (store (select (let ((.cse20 (let ((.cse21 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse20))) (store (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse20) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse18)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse0 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 196) 0)) .cse16 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse17)) is different from false [2024-10-28 18:15:40,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse44 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse27 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse45 (select .cse44 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse20 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse44 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse45 1)))) (.cse0 (= (select .cse27 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse33 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse14 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse36 (store .cse44 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse45))) (.cse34 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse35 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (let ((.cse13 (select |c_#memory_int| 4))) (let ((.cse11 (= (select .cse13 196) 0)) (.cse1 (= (select .cse13 252) 0)) (.cse2 (= (select .cse13 140) 0)) (.cse3 (= (select .cse13 12) 0)) (.cse4 (= (select .cse13 168) 0)) (.cse5 (= (select .cse13 224) 0)) (.cse6 (= (select .cse13 32) 0)) (.cse7 (= (select .cse13 0) 0)) (.cse8 (= (select .cse13 56) 0)) (.cse9 (= (select .cse13 28) 0)) (.cse12 (= (select .cse13 84) 0)) (.cse10 (= (select .cse13 60) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse12) (and (= (select .cse13 112) 0) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and (or (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and (or (and (or (and .cse1 .cse3 .cse4 .cse5 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse6 .cse7 .cse8 .cse9) (and .cse2 (or (and .cse6 (or (and .cse1 .cse3 .cse4 .cse5 .cse7 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse9) (and (or (and .cse7 (or (and .cse1 (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) .cse9) (and (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (and (or (and .cse3 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) .cse4) .cse9)) .cse5))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252)) .cse3 .cse4 .cse5 .cse9))) (and .cse1 .cse3 .cse4 .cse5 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) .cse9)) .cse8))) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9)))) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)))) .cse12)) .cse10)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse15 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse15)) 0)) (= (select (store (select (let ((.cse17 (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17))) (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse15)) 0)))) (<= 0 (+ 9 .cse20)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse21 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse21)) 0)) (= (select (store (select (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse22 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23))) (store (store .cse22 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse22 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse21)) 0)))) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= .cse20 0) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse26 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse32 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse28 (let ((.cse30 (let ((.cse31 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse29 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse30))) (store (store .cse29 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse30) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse32)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse32)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse33 (or (and .cse0 .cse33 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse34 .cse35) (and .cse33 (= (select (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse27 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse34 .cse35)) (= (select .cse36 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse37 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse37)) 0)) (= (select (store (select (let ((.cse39 (let ((.cse40 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse38 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39))) (store (store .cse38 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse37)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse36))) (store (store .cse43 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse43 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse43 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) .cse34 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse35)))) is different from false [2024-10-28 18:15:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:15:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:15:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-28 18:15:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:15:42,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-28 18:15:42,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-28 18:15:42,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:15:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:15:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash -135914044, now seen corresponding path program 1 times [2024-10-28 18:15:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:15:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761013295] [2024-10-28 18:15:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:15:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:15:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:16:46,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761013295] [2024-10-28 18:16:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761013295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070886892] [2024-10-28 18:16:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:46,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:46,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:46,840 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:16:46,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-28 18:16:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:47,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-10-28 18:16:47,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:48,099 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:16:48,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:16:48,199 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 79 treesize of output 56 [2024-10-28 18:16:48,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 18:16:48,590 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 79 treesize of output 56 [2024-10-28 18:16:48,793 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-10-28 18:16:48,794 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-28 18:16:49,111 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 79 treesize of output 56 [2024-10-28 18:16:49,354 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-10-28 18:16:49,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2024-10-28 18:16:49,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:16:49,601 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 36 treesize of output 27 [2024-10-28 18:16:49,862 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:16:49,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-28 18:16:50,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:16:50,239 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 36 treesize of output 27 [2024-10-28 18:16:51,416 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 239 treesize of output 196 [2024-10-28 18:16:52,234 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2024-10-28 18:16:52,235 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 37 treesize of output 25 [2024-10-28 18:16:53,377 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:16:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 248 treesize of output 350 [2024-10-28 18:16:54,259 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 79 treesize of output 56 [2024-10-28 18:16:54,603 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-28 18:16:54,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 141 [2024-10-28 18:16:56,311 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-28 18:16:56,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 461 treesize of output 340 [2024-10-28 18:17:22,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:17:22,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1895 treesize of output 1103 [2024-10-28 18:17:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:17:28,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:28,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:17:28,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-28 18:17:30,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse2 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2024-10-28 18:17:30,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse4 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) is different from false [2024-10-28 18:17:32,698 INFO L349 Elim1Store]: treesize reduction 81, result has 27.7 percent of original size [2024-10-28 18:17:32,698 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 51 treesize of output 47 [2024-10-28 18:17:32,744 INFO L349 Elim1Store]: treesize reduction 30, result has 57.1 percent of original size [2024-10-28 18:17:32,744 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 65 treesize of output 77 [2024-10-28 18:17:32,753 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 25 treesize of output 18 [2024-10-28 18:17:32,864 WARN L851 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse2 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|))) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse2) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse2) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) .cse2) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse2)))) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|))) (or (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse5 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse5) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) .cse5) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse5) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))))) is different from false [2024-10-28 18:17:32,901 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_~#a~0.base|))) (store .cse0 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse4 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_~#a~0.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) .cse4) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse4) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse4) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse4)))) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) is different from false [2024-10-28 18:17:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 7 refuted. 3 times theorem prover too weak. 55 trivial. 16 not checked. [2024-10-28 18:17:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070886892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:33,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 20] total 61 [2024-10-28 18:17:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104915840] [2024-10-28 18:17:33,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:33,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-28 18:17:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-28 18:17:33,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2655, Unknown=182, NotChecked=678, Total=3782 [2024-10-28 18:17:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:33,609 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:33,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.2903225806451615) internal successors, (204), 61 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:17:33,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:33,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:33,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:33,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-28 18:17:33,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:33,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:17:33,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:56,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse23 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse33 (select .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse33 1)))) (.cse0 (= (select .cse23 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse19 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse20 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse24 (store .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse33))) (.cse1 (select |c_#memory_int| 4)) (.cse21 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse22 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (= (select (store (select (let ((.cse5 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse3)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse1 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse9)) 0)) (= (select (store (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse10 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse10 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 56) 0)) (or (= (select .cse1 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= (select .cse1 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (or (= (select .cse1 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 32) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse18 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse14 (let ((.cse16 (let ((.cse17 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse15 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse16))) (store (store .cse15 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse16) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse18)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse18)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse19 (or (= (select .cse1 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse1 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 60) 0)) (or (and .cse0 .cse19 .cse20 .cse21 .cse22) (and .cse19 (= (select (store .cse23 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse23 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse21 .cse22)) .cse20 (= (select .cse24 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse25 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse25)) 0)) (= (select (store (select (let ((.cse27 (let ((.cse28 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse26 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27))) (store (store .cse26 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse26 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse25)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse1 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse24))) (store (store .cse31 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse30 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 196) 0)) .cse21 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse22)))) is different from false [2024-10-28 18:18:01,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse44 (select .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse36 (store .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse44)))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse36)) (.cse35 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse44 1)))) (.cse0 (= (select .cse35 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse31 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse32 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse17 (select .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse1 (select |c_#memory_int| 4)) (.cse33 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse34 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (= (select (store (select (let ((.cse5 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse3)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse1 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse9)) 0)) (= (select (store (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse10 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse10 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 56) 0)) (or (= (select .cse1 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse14 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse2 (+ |c_~#a~0.offset| 4 .cse14)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse15 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse15 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse14)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= (select .cse1 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse18 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608))) (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (or (= (select .cse1 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse20 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse2 (+ |c_~#a~0.offset| 4 .cse20)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse21 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse22 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse24))) (store (store .cse22 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse22 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse23 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse24) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse21 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse20)) 0)))) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 32) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse30 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse26 (let ((.cse28 (let ((.cse29 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse27 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse28))) (store (store .cse27 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse28) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse30)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse30)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse31 (or (= (select .cse1 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse1 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 60) 0)) (or (and .cse0 .cse31 .cse32 .cse33 .cse34) (and .cse31 (= (select (store .cse35 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse35 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse33 .cse34)) .cse32 (= (select .cse36 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse37 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse37)) 0)) (= (select (store (select (let ((.cse39 (let ((.cse40 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse38 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39))) (store (store .cse38 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse37)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse1 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse42 (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 196) 0)) .cse33 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse34)))))) is different from false [2024-10-28 18:18:01,976 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse38 (select .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse0 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse13 (store .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse38))) (.cse27 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse38 1)))) (.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (<= 0 (+ 9 .cse0)) (<= .cse0 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse1 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ .cse2 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse6 |c_~#a~0.base| (store (select .cse6 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse9 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse9 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse10 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse1 (+ .cse10 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse11 (let ((.cse12 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse12 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse12 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse10 |c_~#a~0.offset|)) 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select .cse13 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_~#__global_lock~0.offset| 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (let ((.cse23 (select |c_#memory_int| 4))) (let ((.cse21 (= (select .cse23 196) 0)) (.cse14 (= (select .cse23 252) 0)) (.cse15 (= (select .cse23 168) 0)) (.cse16 (= (select .cse23 224) 0)) (.cse17 (= (select .cse23 0) 0)) (.cse18 (= (select .cse23 112) 0)) (.cse19 (= (select .cse23 56) 0)) (.cse20 (= (select .cse23 28) 0)) (.cse22 (= (select .cse23 84) 0))) (or (and .cse14 .cse15 .cse16 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and (= (select .cse23 140) 0) (or (and (or (and .cse14 .cse15 .cse16 .cse17 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse18 .cse20 .cse22) (and (or (and .cse14 .cse15 .cse16 .cse17 .cse20 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse22) (and .cse18 (or (and (or (and .cse16 (or (and (or (and .cse14 .cse20 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) (and .cse15 (or (and .cse14 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252)) .cse20)))) .cse17) (and .cse14 .cse15 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) .cse20))) (and .cse14 .cse15 .cse17 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) .cse20)) .cse22) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84)) .cse14 .cse15 .cse16 .cse17 .cse20)))) .cse19)) .cse21) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse22)))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse28 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (= (select (select (let ((.cse24 (let ((.cse25 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse26 (select (store .cse27 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse25 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse24 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse24 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse28 |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse28 |c_~#a~0.offset| 4)) 0))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse32 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse29 (let ((.cse30 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store .cse27 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse30 |c_~#a~0.base| (store (select .cse30 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse29 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse32 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse32 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse33 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse34 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse1 (+ .cse34 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse35 (let ((.cse36 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse36 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse35 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse35 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse34 |c_~#a~0.offset|)) 0)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))))) is different from false [2024-10-28 18:18:09,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse7 (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse12 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse14 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse0 (select |c_#memory_int| 4)) (.cse15 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse16 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (store (select (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse7 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse2)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse0 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 56) 0)) (or (= (select .cse0 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse1 (+ |c_~#a~0.offset| 4 .cse9)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse7))))) (store (store .cse11 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse10 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse10 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= (select .cse0 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (or (= (select .cse0 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 32) 0)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse12 (or (= (select .cse0 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse0 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 60) 0)) (let ((.cse13 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (or (and (= (select .cse13 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse12 .cse14 .cse15 .cse16) (and .cse12 (= (select (store .cse13 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse13 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse15 .cse16))) .cse14 (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse0 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 196) 0)) .cse15 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse16))) is different from false [2024-10-28 18:18:10,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse8 (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (= (select (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse0 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ .cse1 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse4 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse0 (+ .cse4 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse8))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse6 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse6 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset|)) 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= |c_~#__global_lock~0.offset| 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse12 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse11 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse8 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse10 |c_~#a~0.base| (store (select .cse10 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse12 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse0 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse12 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse13 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse0 (+ .cse13 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse14 (let ((.cse15 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse16 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse16 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse15 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse15 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse14 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse13 |c_~#a~0.offset|)) 0)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)))) is different from false [2024-10-28 18:18:11,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse53 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse54 (select .cse53 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse46 (store .cse53 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse54)))) (let ((.cse28 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse46)) (.cse37 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse20 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse53 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse54 1)))) (.cse0 (= (select .cse37 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse43 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse14 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse29 (select .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse44 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse45 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (let ((.cse13 (select |c_#memory_int| 4))) (let ((.cse11 (= (select .cse13 196) 0)) (.cse1 (= (select .cse13 252) 0)) (.cse2 (= (select .cse13 140) 0)) (.cse3 (= (select .cse13 12) 0)) (.cse4 (= (select .cse13 168) 0)) (.cse5 (= (select .cse13 224) 0)) (.cse6 (= (select .cse13 32) 0)) (.cse7 (= (select .cse13 0) 0)) (.cse8 (= (select .cse13 56) 0)) (.cse9 (= (select .cse13 28) 0)) (.cse12 (= (select .cse13 84) 0)) (.cse10 (= (select .cse13 60) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse12) (and (= (select .cse13 112) 0) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and (or (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and (or (and (or (and .cse1 .cse3 .cse4 .cse5 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse6 .cse7 .cse8 .cse9) (and .cse2 (or (and .cse6 (or (and .cse1 .cse3 .cse4 .cse5 .cse7 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse9) (and (or (and .cse7 (or (and .cse1 (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) .cse9) (and (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (and (or (and .cse3 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) .cse4) .cse9)) .cse5))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252)) .cse3 .cse4 .cse5 .cse9))) (and .cse1 .cse3 .cse4 .cse5 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) .cse9)) .cse8))) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9)))) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)))) .cse12)) .cse10)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse15 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse15)) 0)) (= (select (store (select (let ((.cse17 (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17))) (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse15)) 0)))) (<= 0 (+ 9 .cse20)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse21 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse21)) 0)) (= (select (store (select (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse22 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23))) (store (store .cse22 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse22 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse21)) 0)))) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse26 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse14 (+ |c_~#a~0.offset| 4 .cse26)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse27 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse26)) 0)))) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= .cse20 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse30 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse14 (+ |c_~#a~0.offset| 4 .cse30)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse31 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse34 (let ((.cse35 (select .cse33 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse35 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse35 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse32 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse34))) (store (store .cse32 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse32 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse33 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse34) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse31 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse30)) 0)))) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse36 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse37 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse36 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse42 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse38 (let ((.cse40 (let ((.cse41 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse39 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40))) (store (store .cse39 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse39 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse38 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse38 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse42)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse42)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse43 (or (and .cse0 .cse43 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse44 .cse45) (and .cse43 (= (select (store .cse37 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse37 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse44 .cse45)) (= (select .cse46 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse47 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse47)) 0)) (= (select (store (select (let ((.cse49 (let ((.cse50 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse51 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse51 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse48 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse49))) (store (store .cse48 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse48 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse49) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse47)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse52 (store (store .cse28 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse52 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse52 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) .cse44 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse45)))))) is different from false [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:18:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-28 18:18:20,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-28 18:18:20,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-28 18:18:20,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:18:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash 236107630, now seen corresponding path program 1 times [2024-10-28 18:18:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086735809] [2024-10-28 18:18:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-28 18:18:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:20,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086735809] [2024-10-28 18:18:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086735809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:18:20,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392280699] [2024-10-28 18:18:20,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:20,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:20,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:18:20,596 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:18:20,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-28 18:18:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:20,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-28 18:18:20,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:18:21,031 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 18:18:21,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:18:21,062 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 16 treesize of output 11 [2024-10-28 18:18:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-28 18:18:21,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:18:21,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2196 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base| v_ArrVal_2196) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|) 0))) is different from false [2024-10-28 18:18:21,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:18:21,093 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 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-28 18:18:21,095 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 33 treesize of output 25 [2024-10-28 18:18:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-28 18:18:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392280699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:18:21,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:18:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-28 18:18:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680687017] [2024-10-28 18:18:21,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:18:21,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-28 18:18:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-28 18:18:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=116, Unknown=1, NotChecked=22, Total=182 [2024-10-28 18:18:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:21,183 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-28 18:18:21,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:18:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-28 18:18:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:18:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-28 18:18:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:18:29,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-28 18:18:30,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:30,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:18:30,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1177255350, now seen corresponding path program 1 times [2024-10-28 18:18:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:30,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678577617] [2024-10-28 18:18:30,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:18:56,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:56,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678577617] [2024-10-28 18:18:56,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678577617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:18:56,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654124538] [2024-10-28 18:18:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:18:56,010 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:18:56,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-28 18:18:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:56,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-28 18:18:56,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:18:57,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:18:57,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:18:57,447 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 79 treesize of output 56 [2024-10-28 18:18:57,607 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 18:18:57,825 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 79 treesize of output 56 [2024-10-28 18:18:58,042 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-10-28 18:18:58,043 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-28 18:18:58,377 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 79 treesize of output 56 [2024-10-28 18:18:58,601 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-10-28 18:18:58,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2024-10-28 18:18:58,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:18:58,860 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 36 treesize of output 27 [2024-10-28 18:18:59,104 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:18:59,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-28 18:18:59,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:18:59,543 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 36 treesize of output 27 [2024-10-28 18:19:00,618 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 239 treesize of output 196 [2024-10-28 18:19:01,404 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2024-10-28 18:19:01,404 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 37 treesize of output 25 [2024-10-28 18:19:02,591 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:19:02,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 248 treesize of output 350 [2024-10-28 18:19:03,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 79 treesize of output 56 [2024-10-28 18:19:03,623 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-28 18:19:03,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 141 [2024-10-28 18:19:04,248 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-28 18:19:04,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 126 treesize of output 181 [2024-10-28 18:19:05,359 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-28 18:19:05,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 211 [2024-10-28 18:19:33,759 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-28 18:19:33,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 2057 treesize of output 1312 [2024-10-28 18:20:04,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:20:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1840 treesize of output 1068 [2024-10-28 18:20:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:20:07,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:20:09,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (= (select (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse3)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) is different from false [2024-10-28 18:20:09,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (select (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) is different from false [2024-10-28 18:20:13,834 INFO L349 Elim1Store]: treesize reduction 81, result has 27.7 percent of original size [2024-10-28 18:20:13,834 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 51 treesize of output 47 [2024-10-28 18:20:13,881 INFO L349 Elim1Store]: treesize reduction 30, result has 57.1 percent of original size [2024-10-28 18:20:13,881 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 65 treesize of output 77 [2024-10-28 18:20:13,888 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 25 treesize of output 18 [2024-10-28 18:20:16,022 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_17| Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (forall ((|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28)))) (or (= .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (= .cse0 |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int)) (or (= .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) .cse0) 0)))))))))) (or (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int)) (let ((.cse3 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28)))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (= .cse3 |t_funThread3of4ForFork0_~p~0#1.offset|) (= .cse3 |t_funThread2of4ForFork0_~p~0#1.offset|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) .cse3) 0))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) 0))))) is different from false [2024-10-28 18:20:18,066 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_17| Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (forall ((|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28)))) (or (= .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (= .cse0 |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int)) (or (= .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) .cse0) 0)))))))) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_~#a~0.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_~#a~0.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|))))) is different from false [2024-10-28 18:20:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 55 trivial. 11 not checked. [2024-10-28 18:20:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654124538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:20:18,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:20:18,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29, 20] total 65 [2024-10-28 18:20:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527180263] [2024-10-28 18:20:18,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:20:18,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-28 18:20:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:20:18,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-28 18:20:18,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=3311, Unknown=166, NotChecked=492, Total=4290 [2024-10-28 18:20:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:20:18,789 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:20:18,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.696969696969697) internal successors, (244), 65 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:20:18,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:20:18,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:20:18,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:20:18,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-28 18:20:18,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:20:18,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:20:18,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-28 18:20:18,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:20:18,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:20:30,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:20:35,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:20:49,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 [1] [2024-10-28 18:20:51,567 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse21 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse28 (select .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse19 (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse29 (store .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse28))) (.cse22 (select .cse21 |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (.cse5 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse38 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse13 (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (.cse3 (and (= .cse22 1) .cse5 .cse38)) (.cse4 (= (select .cse21 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse16 (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse23 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse17 (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29)) (.cse24 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse9 (select |c_#memory_int| 4)) (.cse20 (not .cse19)) (.cse6 (not .cse38)) (.cse18 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2380 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (or .cse3 (and .cse4 .cse5 .cse6)) .cse7 (<= 0 (+ 9 .cse8)) (<= .cse8 0) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= 84 |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= (select .cse9 84) 0)) (let ((.cse15 (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (let ((.cse10 (select .cse15 (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)))) (or (= .cse10 1) (let ((.cse12 (not (= .cse10 0)))) (and (or (let ((.cse11 (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or (not .cse11) (and .cse12 (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) .cse13 (or (and (= (select .cse14 28) 0) .cse7 (= (select .cse14 84) 0) (= (select .cse14 196) 0) (= (select .cse14 112) 0) (= (select .cse14 224) 0) (= (select .cse14 0) 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.base| |c_~#__global_lock~0.base|)) (or (not (= .cse10 (select .cse15 4))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| 0))) (or (not (= (select .cse15 32) .cse10)) (not .cse16)) (= |c_~#a~0.offset| 0) (= (select .cse14 252) 0) .cse17 (= (select .cse14 168) 0) (= (select .cse14 140) 0) (= (select .cse14 56) 0) (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) .cse18) .cse11))) .cse19) (or (and .cse12 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) .cse20)))))) (or (= 56 |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse9 56) 0)) (or (= (select .cse9 252) 0) (= 252 |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse9 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= |c_t_funThread3of4ForFork0_~p~0#1.offset| 168)) .cse13 (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse5 (or (= (select .cse9 0) 0) (= |c_t_funThread3of4ForFork0_~p~0#1.offset| 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (and .cse5 (= (select (store (store .cse21 |c_t_funThread3of4ForFork0_~p~0#1.offset| (+ (- 1) .cse22)) |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse21 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)) .cse3 (and .cse4 .cse5 .cse23 .cse6)) (or .cse16 (= |c_t_funThread3of4ForFork0_~p~0#1.offset| 28) (= (select .cse9 28) 0)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse25 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse24 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse25)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (= (select (store (select (let ((.cse26 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse27 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse28 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse27 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse27 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse26 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| .cse25)) 0)))) .cse23 (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= 196 |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= (select .cse9 196) 0)) (= (select .cse29 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2380 Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse30 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) .cse17 (or (= (select .cse9 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= 140 |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (or (= (select .cse9 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= 224 |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse32 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse24 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse32)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse33 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| .cse32)) 0)))) (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2380 Int)) (let ((.cse37 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (= (select (select (let ((.cse35 (let ((.cse36 (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse36 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse35 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse35 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse37)) 0) (not (= (select .cse24 (+ |c_~#a~0.offset| 4 .cse37)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (or (= (select .cse9 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= 112 |c_t_funThread3of4ForFork0_~p~0#1.offset|)) .cse20 (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse6 (= (select .cse14 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse18))))) is different from false [2024-10-28 18:21:00,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:21:05,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:21:10,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:21:13,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:21:26,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:21:39,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:21:56,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse72 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse73 (select .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse65 (store .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse73)))) (let ((.cse15 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse65)) (.cse24 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse7 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse73 1)))) (.cse0 (= (select .cse24 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse62 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse16 (select .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse63 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse64 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (store (select (let ((.cse4 (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse2)) 0)))) (<= 0 (+ 9 .cse7)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse8 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse8)) 0)) (= (select (store (select (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse9 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10))) (store (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse8)) 0)))) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse13 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse1 (+ |c_~#a~0.offset| 4 .cse13)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse13)) 0)))) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= .cse7 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse17 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse1 (+ |c_~#a~0.offset| 4 .cse17)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse21))) (store (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse20 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse21) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse17)) 0)))) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse23 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse24 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse23 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (let ((.cse56 (select |c_#memory_int| 4))) (let ((.cse35 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse28 (= (select .cse56 32) 0)) (.cse44 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0))) (.cse25 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252))) (.cse30 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224))) (.cse46 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse41 (= (select .cse56 252) 0)) (.cse26 (= (select .cse56 12) 0)) (.cse27 (= (select .cse56 168) 0)) (.cse33 (= (select .cse56 224) 0)) (.cse29 (= (select .cse56 0) 0)) (.cse31 (= (select .cse56 56) 0)) (.cse32 (= (select .cse56 28) 0))) (let ((.cse34 (= (select .cse56 140) 0)) (.cse49 (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse31 .cse32)) (.cse54 (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse46 .cse32)) (.cse55 (and .cse26 .cse27 .cse30 .cse32)) (.cse47 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (.cse50 (and .cse25 .cse26 .cse27 .cse33 .cse32)) (.cse45 (and .cse41 .cse26 .cse27 .cse33 .cse44 .cse32)) (.cse48 (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32))) (let ((.cse53 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) (.cse39 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84))) (.cse40 (or (and .cse34 (or .cse49 (and (or .cse54 (and (or (and (or (and .cse41 (or .cse55 (and .cse26 .cse27 .cse47 .cse33))) .cse50) .cse29) .cse45) .cse31)) .cse28))) .cse48)) (.cse52 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse51 (= (select .cse56 112) 0)) (.cse36 (= (select .cse56 60) 0)) (.cse37 (= (select .cse56 196) 0)) (.cse38 (= (select .cse56 84) 0))) (or (and (let ((.cse43 (or (and .cse41 .cse26 .cse27 .cse30 .cse32) .cse50))) (or (and .cse25 (or (and (or (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse26 .cse27 .cse33 .cse29 .cse31 .cse32)) .cse34) (and .cse26 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32)) .cse36 .cse37 .cse38) (and (or (and .cse39 .cse40 .cse37) (and (or (and (let ((.cse42 (or (and .cse44 .cse31) (and .cse29 .cse46)))) (or (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse28 .cse42 .cse32) (and .cse34 (or (and .cse28 (or (and .cse43 .cse44 .cse31) (and (or .cse45 (and .cse43 .cse29)) .cse46))) (and .cse41 .cse26 .cse27 .cse33 .cse42 .cse32))))) .cse37) (and .cse47 (or (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31) (and .cse34 (or (and .cse28 (or (and .cse31 (or (and .cse41 .cse26 .cse27 .cse33 .cse44) (and .cse29 (or (and .cse41 .cse26 .cse27 .cse30) (and .cse25 .cse26 .cse27 .cse33))))) (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse46))) (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse31)))) .cse37)) .cse38)) .cse36) (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 (or (and (or (and (or (and .cse47 .cse29) (and .cse44 .cse32)) .cse38) (and .cse39 .cse29 .cse32)) .cse31) (and .cse29 .cse46 .cse32 .cse38)) .cse37) (and (or .cse48 (and .cse34 (or .cse49 (and .cse43 .cse28 .cse29 .cse31)))) .cse37 .cse38))) .cse51) (and (or (and (or (and .cse41 .cse34 .cse26 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37 .cse38) (and (or (and (or (and .cse41 .cse26 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32) (and .cse34 (or (and (or (and .cse31 (or (and .cse41 .cse26 .cse33 .cse44 .cse32) (and .cse29 (or (and .cse25 .cse26 .cse33 .cse32) (and .cse41 (or (and (or (and .cse26 .cse47) .cse32) .cse33) (and .cse26 .cse30 .cse32))))))) (and .cse41 .cse26 .cse33 .cse29 .cse46 .cse32)) .cse28) (and .cse41 .cse26 .cse33 .cse29 .cse31 .cse32)))) .cse37 .cse38) (and .cse39 .cse41 .cse34 .cse26 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37)) .cse36)) .cse51) (and .cse41 .cse34 .cse26 .cse33 .cse28 .cse29 .cse31 .cse32 .cse36 .cse37 .cse52 .cse38)) .cse53) (and .cse51 .cse30 .cse36 (or (and .cse41 .cse34 .cse26 .cse27 .cse29 .cse31 .cse32) (and .cse41 .cse26 .cse27 .cse35 .cse28 .cse29 .cse31 .cse32)) .cse37 .cse38) (and (or (and (or (and .cse39 .cse41 .cse34 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37) (and (or (and .cse34 (or (and (or (and .cse41 .cse27 .cse33 .cse29 .cse46 .cse32) (and (or (and .cse41 .cse27 .cse33 .cse44 .cse32) (and .cse29 (or (and .cse41 (or (and .cse27 .cse30 .cse32) (and .cse27 .cse47 .cse33))) (and .cse25 .cse27 .cse33 .cse32)))) .cse31)) .cse28) (and .cse41 .cse27 .cse33 .cse29 .cse31 .cse32))) (and .cse41 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32)) .cse37 .cse38)) .cse36) (and .cse41 .cse34 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37 .cse38)) .cse51) (and (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (or (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse36 .cse52 .cse38) (and (or (and .cse36 (or (and .cse39 .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32) (and (or .cse48 (and .cse34 (or (and .cse28 (or .cse54 (and (or (and .cse29 (or (and .cse41 (or .cse55 (and (or (and .cse26 .cse27 .cse47) (and (or (and .cse26 .cse53) .cse27) .cse32)) .cse33))) .cse50)) .cse45) .cse31))) .cse49))) .cse38))) (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse38)) .cse51))) (and (or (and (or (and .cse39 .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37) (and .cse40 .cse37 .cse38)) .cse36) (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37 .cse38)) .cse52) (and .cse41 .cse34 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse36 .cse37 .cse52 .cse38) (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse29 .cse51 .cse31 .cse32 .cse36 .cse37 .cse38)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse61 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse57 (let ((.cse59 (let ((.cse60 (select (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse58 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse59))) (store (store .cse58 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse58 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse59) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse57 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse57 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse61)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse61)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse62 (or (and .cse0 .cse62 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse63 .cse64) (and .cse62 (= (select (store .cse24 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse24 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse63 .cse64)) (= (select .cse65 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse66 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse66)) 0)) (= (select (store (select (let ((.cse68 (let ((.cse69 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse70 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse70 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse69 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse69 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse67 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse68))) (store (store .cse67 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse67 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse68) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse66)) 0)))) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse71 (store (store .cse15 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse71 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse71 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) .cse63 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse64)))))) is different from false [2024-10-28 18:21:56,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse50 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse55 (select .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse27 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse40 (store .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse55))) (.cse44 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse55 1)))) (.cse28 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (let ((.cse24 (select |c_#memory_int| 4))) (let ((.cse8 (= (select .cse24 168) 0)) (.cse1 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0))) (.cse7 (= (select .cse24 252) 0)) (.cse10 (= (select .cse24 28) 0)) (.cse14 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168)))) (let ((.cse26 (and .cse7 .cse10 .cse14)) (.cse23 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (.cse13 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252))) (.cse25 (and .cse7 .cse8 .cse1 .cse10)) (.cse19 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84))) (.cse2 (= (select .cse24 224) 0)) (.cse12 (= (select .cse24 0) 0))) (let ((.cse18 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse22 (and .cse19 .cse7 .cse8 .cse2 .cse12 .cse10)) (.cse20 (or (and (or .cse26 (and .cse8 (or (and .cse7 .cse23) (and .cse13 .cse10)))) .cse12) .cse25)) (.cse6 (= (select .cse24 84) 0)) (.cse3 (= (select .cse24 112) 0)) (.cse5 (or .cse26 (and .cse13 .cse8 .cse10)))) (let ((.cse16 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse21 (or .cse25 (and .cse12 .cse5))) (.cse17 (or (and .cse7 .cse8 .cse2 .cse12 .cse10 .cse18 .cse6) (and (or .cse22 (and .cse2 .cse20 .cse6)) .cse3))) (.cse4 (= (select .cse24 56) 0)) (.cse15 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse0 (= (select .cse24 140) 0)) (.cse9 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse11 (= (select .cse24 196) 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse9 .cse3 .cse10 .cse6)) .cse11) (and .cse0 (or (and .cse7 .cse2 .cse12 .cse9 .cse3 .cse10 .cse6) (and .cse13 .cse2 .cse12 .cse3 .cse4 .cse10 .cse6)) .cse11 .cse14) (and .cse7 .cse8 .cse2 .cse15 .cse12 .cse3 .cse4 .cse10 .cse16 .cse6) (and .cse0 .cse16 (or (and .cse17 .cse4) (and .cse7 .cse8 .cse2 .cse12 .cse9 .cse3 .cse10 .cse6))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) (or (and .cse7 .cse8 .cse15 .cse12 .cse3 .cse4 .cse10 .cse11 .cse6) (and (or (and (or (and .cse4 (or (and .cse7 .cse8 .cse12 .cse10 .cse18 .cse6) (and (or (and .cse19 .cse7 .cse8 .cse12 .cse10) (and .cse20 .cse6)) .cse3))) (and .cse7 .cse8 .cse12 .cse9 .cse3 .cse10 .cse6)) .cse11) (and .cse7 .cse8 .cse12 .cse3 .cse4 .cse10 .cse16 .cse6)) .cse0))) (and .cse19 .cse0 (or (and .cse2 .cse3 .cse21 .cse4) (and .cse7 .cse8 .cse2 .cse12 .cse9 .cse3 .cse10)) .cse11) (and .cse0 (or (and .cse7 .cse8 .cse2 .cse12 .cse9 .cse10 .cse6) (and (or (and .cse2 .cse21 .cse6) .cse22) .cse4)) .cse11 .cse18) (and .cse11 (or (and (or (and .cse15 .cse17) (and (or (and .cse7 .cse8 .cse23 .cse2 .cse12 .cse18 .cse6) (and (or (and .cse19 .cse7 .cse8 .cse23 .cse2 .cse12) (and .cse2 (or (and .cse12 (or (and .cse13 .cse8 .cse23) (and .cse7 .cse23 .cse14))) (and .cse7 .cse8 .cse23 .cse1)) .cse6)) .cse3)) .cse0)) .cse4) (and .cse7 (or (and .cse15 .cse10) (and .cse0 .cse23)) .cse8 .cse2 .cse12 .cse9 .cse3 .cse6))) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse9 .cse3 .cse10 .cse11 .cse6))))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (<= 0 (+ 9 .cse27)) (<= .cse27 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse29 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse28 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse29 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse30 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ .cse29 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse36 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse32 (let ((.cse33 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse34 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse35 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse35 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse33 |c_~#a~0.base| (store (select .cse33 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse32 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse36 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse28 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse36 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse37 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse28 (+ .cse37 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse38 (let ((.cse39 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse39 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse39 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse37 |c_~#a~0.offset|)) 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select .cse40 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_~#__global_lock~0.offset| 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse45 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (= (select (select (let ((.cse41 (let ((.cse42 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse43 (select (store .cse44 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse41 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse41 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse45 |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse45 |c_~#a~0.offset| 4)) 0))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse49 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse46 (let ((.cse47 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse48 (select (store .cse44 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse48 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse48 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse47 |c_~#a~0.base| (store (select .cse47 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse46 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse46 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse49 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse28 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse49 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse50 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse51 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse28 (+ .cse51 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse52 (let ((.cse53 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse53 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse53 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse52 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse52 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse51 |c_~#a~0.offset|)) 0)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))))) is different from false [2024-10-28 18:21:57,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse56 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse75 (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse27 (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse61 (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse75))) (.cse57 (select .cse56 |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (.cse5 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse76 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse14 (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse23 (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (.cse3 (and (= .cse57 1) .cse5 .cse76)) (.cse4 (= (select .cse56 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse6 (not .cse76)) (.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse75 1)))) (.cse25 (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse61)) (.cse51 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse28 (not .cse27)) (.cse26 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2380 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (or .cse3 (and .cse4 .cse5 .cse6)) .cse7 (<= 0 (+ 9 .cse8)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse12 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (= (select (store (select (let ((.cse9 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse10 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| .cse12)) 0) (not (= (select (select (store (let ((.cse13 (store |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base|) (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1)))) (store .cse13 |c_~#a~0.base| (store (select .cse13 |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1))) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse12)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse15 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse15)) 0)) (= (select (select (let ((.cse16 (let ((.cse17 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse15)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) (<= .cse8 0) (let ((.cse20 (select .cse14 (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)))) (or (= .cse20 1) (let ((.cse22 (not (= .cse20 0)))) (and (or (let ((.cse21 (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or (not .cse21) (and .cse22 (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) .cse23 (or (and (= (select .cse24 28) 0) .cse7 (= (select .cse24 84) 0) (= (select .cse24 196) 0) (= (select .cse24 112) 0) (= (select .cse24 224) 0) (= (select .cse24 0) 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.base| |c_~#__global_lock~0.base|)) (or (not (= .cse20 (select .cse14 4))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| 0))) (or (not (= (select .cse14 32) .cse20)) (not (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (= |c_~#a~0.offset| 0) (= (select .cse24 252) 0) .cse25 (= (select .cse24 168) 0) (= (select .cse24 140) 0) (= (select .cse24 56) 0) (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) .cse26) .cse21))) .cse27) (or (and .cse22 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) .cse28))))) (let ((.cse50 (select |c_#memory_int| 4))) (let ((.cse39 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0))) (.cse34 (= (select .cse50 0) 0)) (.cse38 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (.cse30 (= (select .cse50 252) 0)) (.cse42 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252))) (.cse35 (= (select .cse50 28) 0)) (.cse33 (= (select .cse50 224) 0)) (.cse40 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) (.cse32 (= (select .cse50 168) 0)) (.cse41 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)))) (let ((.cse46 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse48 (or (and .cse33 .cse40) (and .cse32 .cse41))) (.cse44 (= (select .cse50 56) 0)) (.cse43 (= (select .cse50 112) 0)) (.cse29 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84))) (.cse49 (or (and .cse30 .cse32 .cse33 .cse39 .cse35) (and .cse34 (or (and (or (and .cse32 .cse41 .cse35) (and .cse33 (or (and .cse32 .cse38) (and .cse35 .cse40)))) .cse30) (and .cse42 .cse32 .cse33 .cse35))))) (.cse31 (= (select .cse50 140) 0)) (.cse36 (= (select .cse50 196) 0)) (.cse37 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse45 (= (select .cse50 84) 0)) (.cse47 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)))) (or (and .cse29 (or (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and (or (and .cse30 .cse31 .cse32 .cse38 .cse33 .cse34 .cse36) (and (or (and .cse30 (or (and .cse33 (or (and .cse31 .cse32 .cse39) (and .cse31 .cse34 .cse40))) (and .cse31 .cse32 .cse34 .cse41))) (and .cse31 .cse42 .cse32 .cse33 .cse34)) .cse35 .cse36)) .cse43)) .cse44) (and (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (or (and (or (and (or (and .cse30 .cse32 .cse38 .cse33 .cse34 .cse36 .cse45) (and (or (and (or (and (or (and .cse33 (or (and (or (and .cse29 .cse32) (and .cse40 .cse45)) .cse34) (and .cse32 .cse39 .cse45))) (and .cse32 .cse34 .cse41 .cse45)) .cse30) (and .cse42 .cse32 .cse33 .cse34 .cse45)) .cse36) (and .cse30 .cse32 .cse33 .cse34 .cse46 .cse45)) .cse35)) .cse43) (and .cse30 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse45)) .cse44) (and .cse30 .cse32 .cse33 .cse34 .cse47 .cse43 .cse35 .cse36 .cse45))) (and (or (and (or (and .cse43 (or (and (or (and .cse31 (or (and .cse34 (or (and .cse42 .cse32 .cse33) (and .cse30 .cse48))) (and .cse30 .cse32 .cse33 .cse39)) .cse45) (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) .cse35) (and .cse30 .cse31 .cse32 .cse38 .cse33 .cse34 .cse45))) (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse45)) .cse44) (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse47 .cse43 .cse35 .cse45)) .cse46) (and (or (and (or (and .cse30 .cse31 .cse32 .cse38 .cse33 .cse36 .cse45) (and .cse30 (or (and .cse31 .cse32 .cse41 .cse45) (and .cse31 .cse33 .cse40 .cse45)) .cse35 .cse36)) .cse39 .cse43) (and .cse31 .cse49 .cse36 .cse37 .cse45) (and (or (and .cse31 .cse32 .cse38 .cse33 .cse34 .cse36 .cse45) (and .cse31 .cse35 .cse36 (or (and .cse34 .cse48) (and .cse32 .cse33 .cse39)) .cse45)) .cse42 .cse43) (and (or (and .cse30 .cse31 .cse38 .cse34 .cse48 .cse36 .cse45) (and .cse30 .cse31 .cse34 .cse41 .cse35 .cse36 .cse40 .cse45)) .cse43)) .cse44) (and (or (and .cse43 (or (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse31 .cse49 .cse36 .cse45))) (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse45)) .cse47))))) .cse23 (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse5 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse52 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse51 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse52)) 0)) (= (select (store (select (let ((.cse53 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse54 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse55 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse55 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse53 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse53 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| .cse52)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) (or (and .cse5 (= (select (store (store .cse56 |c_t_funThread3of4ForFork0_~p~0#1.offset| (+ (- 1) .cse57)) |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)) .cse3 (and .cse4 .cse5 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse6)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse58 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse51 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse58)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (= (select (store (select (let ((.cse59 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse60 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse59 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse59 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| .cse58)) 0)))) (= (select .cse61 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2380 Int)) (= (select (select (let ((.cse62 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse63 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse63 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse62 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse62 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2379 Int) (v_ArrVal_2380 Int)) (= (select (select (let ((.cse64 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse56 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379)))) (store .cse64 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse64 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) .cse25 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2379 Int) (v_ArrVal_2365 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse65 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse51 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2370) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse65)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse66 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2365) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse67 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse67 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse66 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse66 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380) (+ |c_~#a~0.offset| .cse65)) 0)))) (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2380 Int)) (let ((.cse70 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (= (select (select (let ((.cse68 (let ((.cse69 (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse69 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse69 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse68 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse68 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse70)) 0) (not (= (select .cse51 (+ |c_~#a~0.offset| 4 .cse70)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) (forall ((v_ArrVal_2379 Int) (v_ArrVal_2373 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_17| Int) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2380 Int)) (let ((.cse74 (* |v_t_funThread4of4ForFork0_~i~0#1_17| 28))) (or (= (select (select (let ((.cse71 (let ((.cse72 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse73 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2371) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse73 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse73 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2373))) (store .cse72 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse72 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2379))))) (store .cse71 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse71 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2380))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse74)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_17| 0) (not (= (select .cse51 (+ |c_~#a~0.offset| 4 .cse74)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_17|)))) .cse28 (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= (select .cse24 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse26))))) is different from false [2024-10-28 18:22:02,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-28 18:22:02,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-28 18:22:03,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-28 18:22:03,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:22:03,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:22:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 839196724, now seen corresponding path program 4 times [2024-10-28 18:22:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:22:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782698957] [2024-10-28 18:22:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:22:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:22:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15