./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-22 12:18:31,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-22 12:18:31,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-22 12:18:31,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-22 12:18:31,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-22 12:18:32,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-22 12:18:32,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-22 12:18:32,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-22 12:18:32,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-22 12:18:32,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-22 12:18:32,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-22 12:18:32,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-22 12:18:32,008 INFO L153 SettingsManager]: * Use SBE=true [2024-09-22 12:18:32,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-22 12:18:32,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-22 12:18:32,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-22 12:18:32,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-22 12:18:32,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-22 12:18:32,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-22 12:18:32,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-22 12:18:32,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-22 12:18:32,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-22 12:18:32,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-22 12:18:32,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-22 12:18:32,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-22 12:18:32,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-22 12:18:32,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-22 12:18:32,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-22 12:18:32,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-22 12:18:32,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-22 12:18:32,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 12:18:32,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-22 12:18:32,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-22 12:18:32,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-22 12:18:32,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-22 12:18:32,021 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-22 12:18:32,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-22 12:18:32,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-22 12:18:32,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-22 12:18:32,022 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-22 12:18:32,023 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-22 12:18:32,024 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2024-09-22 12:18:32,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-22 12:18:32,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-22 12:18:32,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-22 12:18:32,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-22 12:18:32,318 INFO L274 PluginConnector]: CDTParser initialized [2024-09-22 12:18:32,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2024-09-22 12:18:33,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-22 12:18:34,097 INFO L384 CDTParser]: Found 1 translation units. [2024-09-22 12:18:34,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2024-09-22 12:18:34,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/137b61400/19aa1b635c9a443fbe82d750bb9c38af/FLAG4a120c59b [2024-09-22 12:18:34,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/137b61400/19aa1b635c9a443fbe82d750bb9c38af [2024-09-22 12:18:34,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-22 12:18:34,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-22 12:18:34,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-22 12:18:34,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-22 12:18:34,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-22 12:18:34,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 12:18:34" (1/1) ... [2024-09-22 12:18:34,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f584b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:34, skipping insertion in model container [2024-09-22 12:18:34,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 12:18:34" (1/1) ... [2024-09-22 12:18:34,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-22 12:18:34,887 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2024-09-22 12:18:34,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 12:18:34,963 INFO L200 MainTranslator]: Completed pre-run [2024-09-22 12:18:35,019 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2024-09-22 12:18:35,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 12:18:35,149 INFO L204 MainTranslator]: Completed translation [2024-09-22 12:18:35,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35 WrapperNode [2024-09-22 12:18:35,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-22 12:18:35,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-22 12:18:35,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-22 12:18:35,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-22 12:18:35,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,234 INFO L138 Inliner]: procedures = 271, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 216 [2024-09-22 12:18:35,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-22 12:18:35,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-22 12:18:35,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-22 12:18:35,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-22 12:18:35,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-22 12:18:35,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-22 12:18:35,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-22 12:18:35,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-22 12:18:35,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (1/1) ... [2024-09-22 12:18:35,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 12:18:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:35,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-22 12:18:35,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-22 12:18:35,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-22 12:18:35,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-09-22 12:18:35,383 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-09-22 12:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-22 12:18:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-22 12:18:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-22 12:18:35,387 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-22 12:18:35,513 INFO L242 CfgBuilder]: Building ICFG [2024-09-22 12:18:35,515 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-22 12:18:35,803 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-22 12:18:35,803 INFO L291 CfgBuilder]: Performing block encoding [2024-09-22 12:18:36,003 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-22 12:18:36,005 INFO L318 CfgBuilder]: Removed 23 assume(true) statements. [2024-09-22 12:18:36,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 12:18:36 BoogieIcfgContainer [2024-09-22 12:18:36,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-22 12:18:36,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-22 12:18:36,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-22 12:18:36,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-22 12:18:36,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 12:18:34" (1/3) ... [2024-09-22 12:18:36,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5d234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 12:18:36, skipping insertion in model container [2024-09-22 12:18:36,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:18:35" (2/3) ... [2024-09-22 12:18:36,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5d234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 12:18:36, skipping insertion in model container [2024-09-22 12:18:36,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 12:18:36" (3/3) ... [2024-09-22 12:18:36,018 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2024-09-22 12:18:36,037 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-22 12:18:36,037 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-22 12:18:36,038 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-22 12:18:36,095 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-22 12:18:36,153 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:18:36,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:18:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:36,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:18:36,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-22 12:18:36,195 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:18:36,206 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-09-22 12:18:36,212 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d8c01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:18:36,212 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:18:36,423 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:36,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1569655092, now seen corresponding path program 1 times [2024-09-22 12:18:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023405417] [2024-09-22 12:18:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-22 12:18:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023405417] [2024-09-22 12:18:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023405417] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:18:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:18:36,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:18:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613911935] [2024-09-22 12:18:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:18:36,763 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:18:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:18:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:18:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:36,795 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:36,796 INFO L475 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-09-22 12:18:36,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:37,515 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-22 12:18:37,516 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:37,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:37,516 INFO L85 PathProgramCache]: Analyzing trace with hash 518745025, now seen corresponding path program 1 times [2024-09-22 12:18:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:37,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950215328] [2024-09-22 12:18:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:37,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950215328] [2024-09-22 12:18:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950215328] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:37,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953302760] [2024-09-22 12:18:37,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:37,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:37,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:37,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:18:37,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-22 12:18:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:37,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:18:37,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:37,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:37,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953302760] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:37,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:37,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-09-22 12:18:37,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733493198] [2024-09-22 12:18:37,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:37,822 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-22 12:18:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-22 12:18:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-22 12:18:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:37,824 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:37,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:18:37,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:37,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:37,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-22 12:18:38,157 WARN L456 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-09-22 12:18:38,158 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:38,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -626157979, now seen corresponding path program 2 times [2024-09-22 12:18:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816098975] [2024-09-22 12:18:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:38,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816098975] [2024-09-22 12:18:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816098975] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505867663] [2024-09-22 12:18:38,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:18:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:38,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:38,348 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-09-22 12:18:38,350 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-09-22 12:18:38,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:18:38,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:18:38,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:18:38,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:38,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:38,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505867663] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:38,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-22 12:18:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719312487] [2024-09-22 12:18:38,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:38,527 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 12:18:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 12:18:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-22 12:18:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:38,529 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:38,529 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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-09-22 12:18:38,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:38,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:38,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:38,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-22 12:18:38,859 WARN L456 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-09-22 12:18:38,860 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:38,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1903798043, now seen corresponding path program 3 times [2024-09-22 12:18:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:38,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469266677] [2024-09-22 12:18:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469266677] [2024-09-22 12:18:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469266677] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901597244] [2024-09-22 12:18:39,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:18:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:39,212 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-09-22 12:18:39,213 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-09-22 12:18:39,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-22 12:18:39,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:18:39,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-22 12:18:39,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:39,350 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 7 treesize of output 6 [2024-09-22 12:18:39,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:18:39,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:18:39,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 15 treesize of output 10 [2024-09-22 12:18:39,552 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 15 treesize of output 10 [2024-09-22 12:18:39,591 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 31 treesize of output 25 [2024-09-22 12:18:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:39,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:49,669 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:18:49,696 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:18:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-09-22 12:18:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901597244] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:49,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-09-22 12:18:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264584522] [2024-09-22 12:18:49,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:49,817 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-22 12:18:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:49,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-22 12:18:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=120, Unknown=6, NotChecked=46, Total=210 [2024-09-22 12:18:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:49,819 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:49,820 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 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-09-22 12:18:49,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:49,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:49,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:49,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 12:18:52,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-22 12:18:52,457 WARN L456 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-09-22 12:18:52,458 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:52,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash 123398076, now seen corresponding path program 1 times [2024-09-22 12:18:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:52,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178973396] [2024-09-22 12:18:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:52,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178973396] [2024-09-22 12:18:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178973396] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:52,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657330251] [2024-09-22 12:18:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:52,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:52,561 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-09-22 12:18:52,563 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-09-22 12:18:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:52,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:18:52,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:52,671 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-09-22 12:18:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-22 12:18:52,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-22 12:18:52,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657330251] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:18:52,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-22 12:18:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-09-22 12:18:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27606301] [2024-09-22 12:18:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:18:52,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:18:52,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:18:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-22 12:18:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:52,686 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:52,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-09-22 12:18:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 12:18:52,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 12:18:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:52,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-22 12:18:53,020 WARN L456 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-09-22 12:18:53,020 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:53,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1745557267, now seen corresponding path program 1 times [2024-09-22 12:18:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:53,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546035256] [2024-09-22 12:18:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546035256] [2024-09-22 12:18:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546035256] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915500419] [2024-09-22 12:18:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:53,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:53,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:18:53,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-22 12:18:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:53,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:18:53,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:53,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915500419] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:53,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-22 12:18:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106872391] [2024-09-22 12:18:53,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:53,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:18:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:18:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:18:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:53,279 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:53,279 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:18:53,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:53,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:53,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 12:18:53,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 12:18:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 12:18:53,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-22 12:18:53,406 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-09-22 12:18:53,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:53,596 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-22 12:18:53,597 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-09-22 12:18:53,603 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:18:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:18:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:53,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:18:53,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-09-22 12:18:53,621 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:18:53,621 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 12:18:53,622 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d8c01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:18:53,623 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-22 12:18:53,678 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:18:53,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash 987758996, now seen corresponding path program 1 times [2024-09-22 12:18:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:53,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540683372] [2024-09-22 12:18:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540683372] [2024-09-22 12:18:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540683372] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:18:53,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:18:53,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:18:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196520480] [2024-09-22 12:18:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:18:53,703 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:18:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:18:53,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:18:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:53,705 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:53,705 INFO L475 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-09-22 12:18:53,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,734 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-22 12:18:53,734 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:18:53,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 846523733, now seen corresponding path program 1 times [2024-09-22 12:18:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095265798] [2024-09-22 12:18:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095265798] [2024-09-22 12:18:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095265798] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806266392] [2024-09-22 12:18:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:53,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:53,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:53,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:18:53,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-22 12:18:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:53,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:18:53,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:53,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806266392] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:53,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-09-22 12:18:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001151287] [2024-09-22 12:18:53,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:53,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-22 12:18:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-22 12:18:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-22 12:18:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:53,894 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:53,894 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:18:53,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:53,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-22 12:18:54,125 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:54,126 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:18:54,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -685897223, now seen corresponding path program 2 times [2024-09-22 12:18:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908368018] [2024-09-22 12:18:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908368018] [2024-09-22 12:18:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908368018] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844082960] [2024-09-22 12:18:54,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:18:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:54,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:54,204 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-09-22 12:18:54,206 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-09-22 12:18:54,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:18:54,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:18:54,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:18:54,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:54,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:18:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844082960] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:54,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-22 12:18:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625777475] [2024-09-22 12:18:54,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:54,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 12:18:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:54,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 12:18:54,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-22 12:18:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:54,363 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:54,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:18:54,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:54,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:54,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:54,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-22 12:18:54,597 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:54,597 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:18:54,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1723599993, now seen corresponding path program 3 times [2024-09-22 12:18:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:54,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114362811] [2024-09-22 12:18:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:18:54,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 12:18:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:18:54,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 12:18:54,672 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 12:18:54,673 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-09-22 12:18:54,673 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-22 12:18:54,673 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-22 12:18:54,675 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-22 12:18:54,675 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-09-22 12:18:54,676 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 12:18:54,676 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-22 12:18:54,698 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-09-22 12:18:54,701 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:18:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:18:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:54,703 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:18:54,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-09-22 12:18:54,707 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:18:54,707 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-09-22 12:18:54,708 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d8c01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:18:54,708 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:18:54,997 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:54,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1162885258, now seen corresponding path program 1 times [2024-09-22 12:18:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173886698] [2024-09-22 12:18:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-22 12:18:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173886698] [2024-09-22 12:18:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173886698] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:18:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:18:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:18:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302153447] [2024-09-22 12:18:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:18:55,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:18:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:55,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:18:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:18:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:55,055 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:55,055 INFO L475 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-09-22 12:18:55,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:58,701 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-22 12:18:58,701 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:58,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 146429519, now seen corresponding path program 1 times [2024-09-22 12:18:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628534525] [2024-09-22 12:18:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:58,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:18:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628534525] [2024-09-22 12:18:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628534525] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677216745] [2024-09-22 12:18:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:58,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:58,746 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-09-22 12:18:58,748 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-09-22 12:18:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:58,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:18:58,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:18:58,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:18:58,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677216745] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:58,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:58,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-09-22 12:18:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626781428] [2024-09-22 12:18:58,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:58,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-22 12:18:58,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:58,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-22 12:18:58,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-22 12:18:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:58,864 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:58,864 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:18:58,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:58,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-22 12:19:00,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:00,601 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:00,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 781649003, now seen corresponding path program 2 times [2024-09-22 12:19:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685015052] [2024-09-22 12:19:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:19:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685015052] [2024-09-22 12:19:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685015052] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:00,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493444825] [2024-09-22 12:19:00,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:19:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:00,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:00,703 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-09-22 12:19:00,704 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-09-22 12:19:00,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:19:00,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:19:00,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:19:00,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:19:00,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:19:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493444825] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:00,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-22 12:19:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679510763] [2024-09-22 12:19:00,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:00,870 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 12:19:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 12:19:00,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-22 12:19:00,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:00,871 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:00,871 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:19:00,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:00,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:00,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:01,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-22 12:19:02,145 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-22 12:19:02,146 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:02,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash -793708053, now seen corresponding path program 3 times [2024-09-22 12:19:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841198163] [2024-09-22 12:19:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:02,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841198163] [2024-09-22 12:19:02,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841198163] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852379411] [2024-09-22 12:19:02,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:19:02,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:02,707 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-09-22 12:19:02,709 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-09-22 12:19:02,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-22 12:19:02,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:19:02,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-22 12:19:02,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:02,845 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 7 treesize of output 6 [2024-09-22 12:19:02,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:02,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:19:02,964 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 15 treesize of output 10 [2024-09-22 12:19:03,017 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 15 treesize of output 10 [2024-09-22 12:19:03,059 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 31 treesize of output 25 [2024-09-22 12:19:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:03,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:09,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2024-09-22 12:19:11,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:19:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2024-09-22 12:19:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852379411] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:11,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-09-22 12:19:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799404725] [2024-09-22 12:19:11,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:11,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-22 12:19:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-22 12:19:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=5, NotChecked=54, Total=272 [2024-09-22 12:19:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:11,272 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:11,272 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 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-09-22 12:19:11,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:11,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:11,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:11,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:13,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-22 12:19:13,433 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-22 12:19:13,433 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:13,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -151204257, now seen corresponding path program 1 times [2024-09-22 12:19:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221032554] [2024-09-22 12:19:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-22 12:19:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221032554] [2024-09-22 12:19:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221032554] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:19:13,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:19:13,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-22 12:19:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663271191] [2024-09-22 12:19:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:19:13,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:19:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:19:13,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:19:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:13,636 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:13,636 INFO L475 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-09-22 12:19:13,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:13,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:13,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:13,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:13,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:14,421 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-22 12:19:14,421 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:14,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash -461974521, now seen corresponding path program 1 times [2024-09-22 12:19:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809290117] [2024-09-22 12:19:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:19:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809290117] [2024-09-22 12:19:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809290117] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299493936] [2024-09-22 12:19:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:18,069 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-09-22 12:19:18,070 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-09-22 12:19:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:18,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-22 12:19:18,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:18,206 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 7 treesize of output 6 [2024-09-22 12:19:18,286 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:18,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:19:18,318 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 15 treesize of output 10 [2024-09-22 12:19:18,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-09-22 12:19:18,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 15 treesize of output 10 [2024-09-22 12:19:18,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:18,516 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-09-22 12:19:18,594 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 15 treesize of output 10 [2024-09-22 12:19:18,662 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 0 case distinctions, treesize of input 22 treesize of output 17 [2024-09-22 12:19:18,744 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 38 treesize of output 30 [2024-09-22 12:19:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:18,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:18,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 (Array Int Int)) (v_ArrVal_667 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665))) (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_667))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:19:19,114 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-09-22 12:19:21,128 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_665 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_665 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2024-09-22 12:19:21,134 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:19:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-09-22 12:19:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299493936] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:21,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2024-09-22 12:19:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896909998] [2024-09-22 12:19:21,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:21,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-22 12:19:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-22 12:19:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=989, Unknown=3, NotChecked=198, Total=1332 [2024-09-22 12:19:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:21,269 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:21,269 INFO L475 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-09-22 12:19:21,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:21,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:21,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:21,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:21,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:21,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-22 12:19:24,595 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-09-22 12:19:24,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-22 12:19:24,779 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1100523891, now seen corresponding path program 1 times [2024-09-22 12:19:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575657543] [2024-09-22 12:19:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:24,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:24,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575657543] [2024-09-22 12:19:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575657543] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:24,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759053732] [2024-09-22 12:19:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:24,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:24,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:24,892 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-09-22 12:19:24,895 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-09-22 12:19:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:25,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-22 12:19:25,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:25,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:25,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759053732] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:25,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-22 12:19:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201783371] [2024-09-22 12:19:25,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:25,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-22 12:19:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-22 12:19:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-22 12:19:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:25,103 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:25,103 INFO L475 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-09-22 12:19:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:25,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:25,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-22 12:19:25,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:19:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:19:25,717 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-09-22 12:19:25,903 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-22 12:19:25,904 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:25,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2022260469, now seen corresponding path program 1 times [2024-09-22 12:19:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309546925] [2024-09-22 12:19:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:26,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309546925] [2024-09-22 12:19:26,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309546925] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:26,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649942577] [2024-09-22 12:19:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:26,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:26,657 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-09-22 12:19:26,658 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-09-22 12:19:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:26,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-22 12:19:26,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:26,806 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 7 treesize of output 6 [2024-09-22 12:19:26,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:26,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:19:26,880 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 15 treesize of output 10 [2024-09-22 12:19:26,924 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 15 treesize of output 10 [2024-09-22 12:19:26,990 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 15 treesize of output 10 [2024-09-22 12:19:27,021 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 0 case distinctions, treesize of input 24 treesize of output 17 [2024-09-22 12:19:27,083 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 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:19:27,132 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 37 treesize of output 31 [2024-09-22 12:19:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:27,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:37,205 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:19:39,257 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_875) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:19:39,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_875) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:19:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 5 not checked. [2024-09-22 12:19:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649942577] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:39,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-09-22 12:19:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428486627] [2024-09-22 12:19:39,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:39,352 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-22 12:19:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:39,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-22 12:19:39,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=308, Unknown=7, NotChecked=114, Total=506 [2024-09-22 12:19:39,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:39,353 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:39,353 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 22 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:19:39,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:39,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:39,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:39,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:39,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:39,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:19:39,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:19:39,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:19:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:19:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:39,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-09-22 12:19:40,166 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-22 12:19:40,167 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:40,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1442424972, now seen corresponding path program 1 times [2024-09-22 12:19:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334324165] [2024-09-22 12:19:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:19:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334324165] [2024-09-22 12:19:59,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334324165] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327543579] [2024-09-22 12:19:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:59,503 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-09-22 12:19:59,504 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-09-22 12:19:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:59,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-22 12:19:59,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:59,627 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 7 treesize of output 6 [2024-09-22 12:19:59,708 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:59,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:19:59,739 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 15 treesize of output 10 [2024-09-22 12:19:59,789 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 15 treesize of output 10 [2024-09-22 12:19:59,838 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-09-22 12:19:59,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 15 treesize of output 10 [2024-09-22 12:19:59,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:19:59,977 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-09-22 12:19:59,989 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 0 case distinctions, treesize of input 22 treesize of output 17 [2024-09-22 12:20:00,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:00,030 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-09-22 12:20:00,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:20:00,083 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-09-22 12:20:00,157 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 38 treesize of output 30 [2024-09-22 12:20:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:20:00,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:00,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_969 Int) (v_ArrVal_970 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_970) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:20:00,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:20:00,448 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-09-22 12:20:00,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:20:00,457 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-09-22 12:20:00,461 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-09-22 12:20:02,488 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) is different from false [2024-09-22 12:20:02,501 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:20:04,530 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:20:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-09-22 12:20:04,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327543579] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:04,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:04,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 39 [2024-09-22 12:20:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167056615] [2024-09-22 12:20:04,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:04,720 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-22 12:20:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:04,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-22 12:20:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1111, Unknown=12, NotChecked=284, Total=1560 [2024-09-22 12:20:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:04,722 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:04,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:20:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:20:04,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:04,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:20:04,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:20:04,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:04,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:20:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:20:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:20:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-22 12:20:07,808 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-22 12:20:07,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-22 12:20:08,008 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:08,010 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-09-22 12:20:08,010 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-09-22 12:20:08,012 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:20:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:20:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:08,014 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:20:08,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-09-22 12:20:08,021 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:20:08,021 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 12:20:08,022 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d8c01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:20:08,022 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-22 12:20:08,090 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:08,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1736833456, now seen corresponding path program 1 times [2024-09-22 12:20:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772027737] [2024-09-22 12:20:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772027737] [2024-09-22 12:20:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772027737] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:20:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:20:08,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:20:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196941991] [2024-09-22 12:20:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:20:08,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:20:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:20:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:20:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:08,125 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:08,125 INFO L475 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-09-22 12:20:08,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:08,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-22 12:20:08,192 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:08,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 114276282, now seen corresponding path program 1 times [2024-09-22 12:20:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073224557] [2024-09-22 12:20:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073224557] [2024-09-22 12:20:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073224557] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337083887] [2024-09-22 12:20:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:08,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:08,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:08,230 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-09-22 12:20:08,235 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-09-22 12:20:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:08,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:20:08,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337083887] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:08,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:08,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:20:08,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774916576] [2024-09-22 12:20:08,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:08,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:20:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:20:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:20:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:08,363 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:08,363 INFO L475 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-09-22 12:20:08,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:08,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:08,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-09-22 12:20:08,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:08,606 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:08,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1668756194, now seen corresponding path program 2 times [2024-09-22 12:20:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:08,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942792583] [2024-09-22 12:20:08,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:08,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942792583] [2024-09-22 12:20:08,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942792583] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547325969] [2024-09-22 12:20:08,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:20:08,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:08,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:08,667 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-09-22 12:20:08,669 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-09-22 12:20:08,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:20:08,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:20:08,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:20:08,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:20:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547325969] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:08,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:08,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-22 12:20:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454844170] [2024-09-22 12:20:08,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:08,832 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 12:20:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:08,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 12:20:08,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-22 12:20:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:08,833 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:08,833 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:20:08,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:08,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:08,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:08,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-09-22 12:20:09,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-22 12:20:09,079 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:09,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1034782622, now seen corresponding path program 3 times [2024-09-22 12:20:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:09,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800207645] [2024-09-22 12:20:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:20:09,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 12:20:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:20:09,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 12:20:09,118 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 12:20:09,118 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-09-22 12:20:09,118 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-22 12:20:09,119 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-22 12:20:09,121 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-22 12:20:09,121 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-09-22 12:20:09,121 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 12:20:09,121 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-22 12:20:09,148 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-09-22 12:20:09,153 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:20:09,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:20:09,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:09,159 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:20:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-09-22 12:20:09,163 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:20:09,164 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 12:20:09,164 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d8c01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:20:09,165 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-22 12:20:09,276 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:09,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -666338012, now seen corresponding path program 1 times [2024-09-22 12:20:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:09,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878623189] [2024-09-22 12:20:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878623189] [2024-09-22 12:20:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878623189] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:20:09,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:20:09,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:20:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433276754] [2024-09-22 12:20:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:20:09,298 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:20:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:20:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:20:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:09,299 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:09,299 INFO L475 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-09-22 12:20:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:09,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-22 12:20:09,431 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:09,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -467911431, now seen corresponding path program 1 times [2024-09-22 12:20:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775974406] [2024-09-22 12:20:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775974406] [2024-09-22 12:20:09,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775974406] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234250131] [2024-09-22 12:20:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:09,469 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-09-22 12:20:09,470 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-09-22 12:20:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:09,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:20:09,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:09,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234250131] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:09,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-09-22 12:20:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181132829] [2024-09-22 12:20:09,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:09,639 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-22 12:20:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-22 12:20:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-22 12:20:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:09,639 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:09,640 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:20:09,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:09,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:09,708 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-09-22 12:20:09,889 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-22 12:20:09,889 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:09,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash -229942224, now seen corresponding path program 2 times [2024-09-22 12:20:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:09,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465101802] [2024-09-22 12:20:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:09,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465101802] [2024-09-22 12:20:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465101802] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:09,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78841300] [2024-09-22 12:20:09,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:20:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:09,966 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-09-22 12:20:09,968 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-09-22 12:20:10,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:20:10,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:20:10,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:20:10,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:10,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:20:10,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78841300] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:10,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:10,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:20:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559236265] [2024-09-22 12:20:10,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:10,161 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:20:10,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:10,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:20:10,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:20:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:10,162 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:10,162 INFO L475 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-09-22 12:20:10,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:10,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:10,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:10,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-09-22 12:20:10,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-22 12:20:10,427 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:20:10,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1031763856, now seen corresponding path program 3 times [2024-09-22 12:20:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:10,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095125531] [2024-09-22 12:20:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:20:10,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 12:20:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:20:10,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 12:20:10,474 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 12:20:10,474 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-09-22 12:20:10,474 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-22 12:20:10,474 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-22 12:20:10,475 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-22 12:20:10,475 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-09-22 12:20:10,476 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 12:20:10,476 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-09-22 12:20:10,512 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-09-22 12:20:10,514 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:20:10,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:20:10,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:10,517 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:20:10,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-09-22 12:20:10,521 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:20:10,522 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-09-22 12:20:10,523 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d8c01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:20:10,523 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:20:10,704 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:10,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2000659256, now seen corresponding path program 1 times [2024-09-22 12:20:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:10,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554651615] [2024-09-22 12:20:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-22 12:20:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554651615] [2024-09-22 12:20:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554651615] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:20:10,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:20:10,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:20:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51605884] [2024-09-22 12:20:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:20:10,735 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:20:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:10,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:20:10,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:20:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:10,735 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:10,735 INFO L475 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-09-22 12:20:10,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:29,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-22 12:20:29,350 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:29,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:29,351 INFO L85 PathProgramCache]: Analyzing trace with hash 319986895, now seen corresponding path program 1 times [2024-09-22 12:20:29,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:29,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399231257] [2024-09-22 12:20:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:20:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399231257] [2024-09-22 12:20:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399231257] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350580738] [2024-09-22 12:20:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:29,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:29,633 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-09-22 12:20:29,643 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-09-22 12:20:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:29,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:20:29,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:20:29,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:20:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350580738] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:29,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-09-22 12:20:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247867635] [2024-09-22 12:20:29,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:29,873 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-22 12:20:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-22 12:20:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-22 12:20:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:29,874 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:29,874 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:20:29,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:29,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:38,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-09-22 12:20:38,966 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-22 12:20:38,966 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:38,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1147397350, now seen corresponding path program 2 times [2024-09-22 12:20:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063562336] [2024-09-22 12:20:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:20:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063562336] [2024-09-22 12:20:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063562336] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355022116] [2024-09-22 12:20:39,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:20:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:39,065 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:20:39,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-09-22 12:20:39,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:20:39,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:20:39,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:20:39,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:20:39,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:20:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355022116] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:39,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:39,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-22 12:20:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384236477] [2024-09-22 12:20:39,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:39,305 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 12:20:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 12:20:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-22 12:20:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:39,306 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:39,306 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:20:39,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:39,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:39,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:49,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-09-22 12:20:49,332 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:49,332 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:49,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1035841798, now seen corresponding path program 3 times [2024-09-22 12:20:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:49,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294490380] [2024-09-22 12:20:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:21:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:21:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:21:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294490380] [2024-09-22 12:21:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294490380] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:21:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58920103] [2024-09-22 12:21:11,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:21:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:21:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:21:11,897 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:21:11,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-09-22 12:21:12,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-22 12:21:12,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:21:12,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-22 12:21:12,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:21:12,779 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 7 treesize of output 6 [2024-09-22 12:21:12,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:21:12,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:21:12,908 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 15 treesize of output 10 [2024-09-22 12:21:13,012 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 15 treesize of output 10 [2024-09-22 12:21:13,087 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-09-22 12:21:13,219 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 15 treesize of output 10 [2024-09-22 12:21:13,331 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-09-22 12:21:13,331 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-09-22 12:21:13,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:21:13,435 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 27 treesize of output 20 [2024-09-22 12:21:13,455 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 0 case distinctions, treesize of input 24 treesize of output 17 [2024-09-22 12:21:13,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:21:13,534 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 27 treesize of output 20 [2024-09-22 12:21:13,677 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 23 treesize of output 18 [2024-09-22 12:21:13,776 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-22 12:21:13,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2024-09-22 12:21:13,871 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 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:21:14,006 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 0 case distinctions, treesize of input 28 treesize of output 23 [2024-09-22 12:21:14,160 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 28 treesize of output 21 [2024-09-22 12:21:14,254 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 0 case distinctions, treesize of input 37 treesize of output 28 [2024-09-22 12:21:14,390 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 0 case distinctions, treesize of input 35 treesize of output 28 [2024-09-22 12:21:14,625 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 89 treesize of output 75 [2024-09-22 12:21:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:21:14,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:21:14,868 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (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_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:21:14,890 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (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_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) (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_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:21:14,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= 0 (select (select (let ((.cse0 (let ((.cse1 (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| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (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_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (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_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|))) is different from false [2024-09-22 12:21:15,935 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (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_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select |c_#memory_int| |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (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_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:21:16,393 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2024-09-22 12:21:16,393 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 2 case distinctions, treesize of input 43 treesize of output 34 [2024-09-22 12:21:16,429 INFO L349 Elim1Store]: treesize reduction 11, result has 64.5 percent of original size [2024-09-22 12:21:16,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 50 [2024-09-22 12:21:16,437 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-09-22 12:21:16,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (select (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store .cse0 |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (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_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (let ((.cse7 (let ((.cse8 (select (store (store |c_#memory_int| |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse8 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse5 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse7))) (store (store .cse5 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store (store .cse5 |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse7) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse9 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse10 (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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse10 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |c_~#a~0.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)))) is different from false [2024-09-22 12:21:17,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (store (let ((.cse0 (let ((.cse1 (select (store (store |c_#memory_int| |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 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_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (let ((.cse3 (select (store (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse3 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))))) is different from false [2024-09-22 12:21:19,860 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1704 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (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_1704) |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1704 (Array Int Int))) (= (select (store (let ((.cse3 (select (store (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse3 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-09-22 12:21:19,943 WARN L854 $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_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1704 (Array Int Int))) (= (select (store (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (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_1704) |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_1713) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|)))) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (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_1704) |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_1713) |c_~#a~0.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|)))) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2024-09-22 12:21:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 55 trivial. 21 not checked. [2024-09-22 12:21:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58920103] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:21:20,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:21:20,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 20] total 62 [2024-09-22 12:21:20,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612290635] [2024-09-22 12:21:20,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:21:20,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-09-22 12:21:20,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:21:20,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-09-22 12:21:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2714, Unknown=55, NotChecked=904, Total=3906 [2024-09-22 12:21:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:21:20,400 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:21:20,400 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.6825396825396823) internal successors, (232), 62 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:21:20,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:20,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:21:20,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:21:20,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:21:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:21:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:21:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-22 12:21:34,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-09-22 12:21:35,008 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:21:35,008 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:21:35,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:21:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash -524206747, now seen corresponding path program 1 times [2024-09-22 12:21:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:21:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311774208] [2024-09-22 12:21:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:21:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:21:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:21:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-09-22 12:21:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:21:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311774208] [2024-09-22 12:21:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311774208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:21:35,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:21:35,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-22 12:21:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805854443] [2024-09-22 12:21:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:21:35,117 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:21:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:21:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:21:35,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:21:35,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:21:35,118 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:21:35,118 INFO L475 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-09-22 12:21:35,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:35,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:21:35,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:21:35,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-22 12:21:35,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:21:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:21:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:21:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-22 12:21:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:42,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-09-22 12:21:42,601 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:21:42,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:21:42,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1415025143, now seen corresponding path program 1 times [2024-09-22 12:21:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:21:42,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858696464] [2024-09-22 12:21:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:21:42,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:21:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:21:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:21:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:21:42,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858696464] [2024-09-22 12:21:42,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858696464] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:21:42,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873541109] [2024-09-22 12:21:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:21:42,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:21:42,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:21:42,699 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:21:42,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-09-22 12:21:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:21:42,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:21:42,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:21:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:21:42,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:21:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:21:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873541109] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:21:43,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:21:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-22 12:21:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621555883] [2024-09-22 12:21:43,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:21:43,027 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:21:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:21:43,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:21:43,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:21:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:21:43,028 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:21:43,028 INFO L475 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-09-22 12:21:43,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:43,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:21:43,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:21:43,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-22 12:21:43,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:43,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:21:50,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse18 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|)) (.cse1 (select .cse18 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse0 (not .cse17)) (.cse16 (= (select .cse18 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse2 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse3 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (or .cse0 (and (= .cse1 0) .cse2 .cse3)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| 4))) (or (exists ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (and (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (= (store (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)) |t_funThread2of4ForFork0_~p~0#1.offset| (select .cse5 |t_funThread2of4ForFork0_~p~0#1.offset|)) .cse5))) (exists ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (and (not (= |t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (= (store (store (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)) |t_funThread2of4ForFork0_~p~0#1.offset| (select .cse5 |t_funThread2of4ForFork0_~p~0#1.offset|)) |t_funThread3of4ForFork0_~p~0#1.offset| (select .cse5 |t_funThread3of4ForFork0_~p~0#1.offset|)) .cse5))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse8 (let ((.cse9 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse10 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse10 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse9 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse9 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse8))) (store (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store (store .cse6 |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse8) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse11 (let ((.cse14 (let ((.cse15 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse10 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse10 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse15 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse15 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse12 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse14))) (store (store .cse12 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store (store .cse12 |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_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse14) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse13 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (store .cse11 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (or (and .cse2 (= .cse1 1) .cse3) .cse0) (or (and .cse16 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) .cse2 .cse3) .cse17) (or (and .cse16 .cse2 .cse3) .cse17) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))))) is different from false [2024-09-22 12:21:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:21:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:21:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-22 12:21:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:21:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:21:52,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-09-22 12:21:52,281 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:21:52,281 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:21:52,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:21:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1592114150, now seen corresponding path program 4 times [2024-09-22 12:21:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:21:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119130141] [2024-09-22 12:21:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:21:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:21:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:21:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:21:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:21:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119130141] [2024-09-22 12:21:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119130141] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:21:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853642144] [2024-09-22 12:21:57,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-22 12:21:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:21:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:21:57,115 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:21:57,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-09-22 12:21:57,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-22 12:21:57,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:21:57,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-22 12:21:57,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:21:57,816 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 7 treesize of output 6 [2024-09-22 12:21:57,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:21:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:21:57,932 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 15 treesize of output 10 [2024-09-22 12:21:58,016 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 15 treesize of output 10 [2024-09-22 12:21:58,075 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-09-22 12:21:58,220 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 15 treesize of output 10 [2024-09-22 12:21:58,334 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-09-22 12:21:58,334 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-09-22 12:21:58,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:21:58,461 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 27 treesize of output 20 [2024-09-22 12:21:58,486 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 0 case distinctions, treesize of input 24 treesize of output 17 [2024-09-22 12:21:58,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:21:58,581 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 27 treesize of output 20 [2024-09-22 12:21:58,762 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 23 treesize of output 18 [2024-09-22 12:21:58,873 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-22 12:21:58,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2024-09-22 12:21:58,990 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 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:21:59,254 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 0 case distinctions, treesize of input 28 treesize of output 23 [2024-09-22 12:21:59,384 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 28 treesize of output 21 [2024-09-22 12:21:59,481 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 0 case distinctions, treesize of input 35 treesize of output 28 [2024-09-22 12:22:11,991 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 0 case distinctions, treesize of input 73 treesize of output 58 [2024-09-22 12:22:14,262 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 102 treesize of output 88 [2024-09-22 12:22:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:22:14,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:22:16,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2163 Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int))) (= (select (select (let ((.cse2 (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_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse0 (store (select .cse2 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_t_funThread3of4ForFork0_~p~0#1.base| .cse0) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store .cse2 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse0) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:22:16,224 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2163 Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int))) (= (select (select (let ((.cse0 (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| (+ (- 1) (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (let ((.cse3 (store (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_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:22:17,377 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2156) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157))) (let ((.cse5 (let ((.cse6 (select .cse4 |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 ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (let ((.cse3 (store (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:22:17,392 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2156) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (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 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (let ((.cse3 (store (store .cse0 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:22:17,442 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (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 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (let ((.cse3 (store (store .cse0 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 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_2156) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-09-22 12:22:17,464 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2156) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (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 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (let ((.cse3 (store (store .cse0 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse3 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_~#a~0.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:22:17,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (or (= (select (select (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2150) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (let ((.cse3 (store (store .cse0 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse3 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_~#a~0.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2156) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-09-22 12:22:17,635 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2024-09-22 12:22:17,636 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 2 case distinctions, treesize of input 43 treesize of output 34 [2024-09-22 12:22:17,680 INFO L349 Elim1Store]: treesize reduction 11, result has 64.5 percent of original size [2024-09-22 12:22:17,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 50 [2024-09-22 12:22:17,692 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-09-22 12:22:17,773 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_~#a~0.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (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_2150) |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3))) (let ((.cse2 (store (store .cse0 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse1 (store (select .cse2 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse2 |c_~#a~0.base| .cse1) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (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_2150) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10))) (let ((.cse9 (store (store .cse6 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse7 (store (select .cse9 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base| .cse7) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store .cse9 |c_~#a~0.base| .cse7) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse8 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |t_funThread2of4ForFork0_~p~0#1.offset|))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (= (select (select (let ((.cse17 (let ((.cse18 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2150) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse19 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse19 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse13 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17))) (let ((.cse16 (store (store .cse13 |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse14 (store (select .cse16 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store (store (store .cse13 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base| .cse14) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse15 (select (store .cse16 |c_~#a~0.base| .cse14) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse15 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse15 |t_funThread2of4ForFork0_~p~0#1.offset|))))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-09-22 12:22:19,815 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse0 (store (select (store (let ((.cse1 (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_2150) |c_t_funThread1of4ForFork0_~p~0#1.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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (= (select (let ((.cse4 (store (select (store (let ((.cse5 (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_2150) |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_2157) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store .cse4 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-09-22 12:22:21,946 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (or (= (select (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (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_2150) |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_2157) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|)))) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2163 Int) (v_ArrVal_2157 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2160 Int) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2150 (Array Int Int))) (= (select (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2150) |c_~#a~0.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_2157) |c_~#a~0.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)))) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2163))) (store .cse3 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-09-22 12:22:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 24 not checked. [2024-09-22 12:22:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853642144] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:22:22,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:22:22,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18, 20] total 64 [2024-09-22 12:22:22,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60220958] [2024-09-22 12:22:22,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:22:22,406 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-09-22 12:22:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:22:22,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-09-22 12:22:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2762, Unknown=22, NotChecked=1150, Total=4160 [2024-09-22 12:22:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:22:22,408 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:22:22,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.476923076923077) internal successors, (226), 64 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:22:22,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:22:30,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:32,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:34,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:36,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:38,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:40,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:42,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:44,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:46,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:48,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:50,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:52,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:54,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:56,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:22:59,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:01,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:05,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:07,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:09,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:11,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:13,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:16,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:18,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:20,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:22,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:24,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:25,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:27,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:29,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:31,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:38,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:40,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:42,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:45,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:48,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:50,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:52,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:54,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:23:58,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:24:00,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:24:03,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:24:05,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:24:31,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-22 12:24:31,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-09-22 12:24:31,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:24:31,599 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:24:31,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:24:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1825201032, now seen corresponding path program 5 times [2024-09-22 12:24:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:24:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479121359] [2024-09-22 12:24:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:24:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:24:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:24:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:24:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:24:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479121359] [2024-09-22 12:24:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479121359] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:24:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905394076] [2024-09-22 12:24:39,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-22 12:24:39,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:24:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:24:39,593 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:24:39,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-09-22 12:24:44,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-09-22 12:24:44,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:24:44,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-22 12:24:44,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:24:44,464 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 7 treesize of output 6 [2024-09-22 12:24:44,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:24:44,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:24:44,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 15 treesize of output 10 [2024-09-22 12:24:44,694 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-09-22 12:24:44,836 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 15 treesize of output 10 [2024-09-22 12:24:44,946 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-09-22 12:24:44,947 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-09-22 12:24:45,094 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 15 treesize of output 10 [2024-09-22 12:24:45,217 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-09-22 12:24:45,217 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-09-22 12:24:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:24:45,352 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-09-22 12:24:45,380 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 0 case distinctions, treesize of input 22 treesize of output 17 [2024-09-22 12:24:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:24:45,477 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-09-22 12:24:45,657 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 22 treesize of output 15 [2024-09-22 12:24:45,798 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2024-09-22 12:24:45,798 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-09-22 12:24:45,929 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 0 case distinctions, treesize of input 29 treesize of output 22 [2024-09-22 12:24:46,074 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 0 case distinctions, treesize of input 38 treesize of output 27 [2024-09-22 12:24:50,480 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 59 treesize of output 46 [2024-09-22 12:24:54,635 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 0 case distinctions, treesize of input 68 treesize of output 53 [2024-09-22 12:25:00,151 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 0 case distinctions, treesize of input 106 treesize of output 89 [2024-09-22 12:25:01,051 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 427 treesize of output 365 [2024-09-22 12:25:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:25:01,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:25:01,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2339 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (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| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (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_2339))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:25:01,969 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2339 Int)) (= (select (select (let ((.cse0 (let ((.cse3 (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_2334)))) (let ((.cse1 (let ((.cse4 (select .cse3 |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|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (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_2339))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-09-22 12:25:02,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2331) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse3 (store (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (let ((.cse1 (let ((.cse4 (select (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |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|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (- 1)))))))))) (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_2339))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:25:02,783 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (let ((.cse5 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|) |c_t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse3 (store (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (let ((.cse1 (let ((.cse4 (select (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |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|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (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_2339))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2331) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-09-22 12:25:02,831 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (let ((.cse5 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|) |c_t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse3 (store (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (let ((.cse1 (let ((.cse4 (select (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |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|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (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_2339))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 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_2331) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-09-22 12:25:02,846 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse4 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|) |c_t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse2 (store (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (let ((.cse0 (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |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|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2331) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-09-22 12:25:02,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2331) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (select (let ((.cse4 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2325) |c_t_funThread1of4ForFork0_~p~0#1.base|) |c_t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse2 (store (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (let ((.cse0 (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |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|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:25:03,147 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2331) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2325) |c_t_funThread1of4ForFork0_~p~0#1.base|) |c_t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse1 (store (select .cse3 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (store (store |c_#memory_int| |c_~#a~0.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_~#a~0.base| .cse1) |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_2336) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-09-22 12:25:03,320 INFO L349 Elim1Store]: treesize reduction 81, result has 27.7 percent of original size [2024-09-22 12:25:03,321 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 48 treesize of output 44 [2024-09-22 12:25:03,415 INFO L349 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2024-09-22 12:25:03,416 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 59 treesize of output 62 [2024-09-22 12:25:03,428 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-09-22 12:25:03,568 WARN L854 $PredicateComparison]: unable to prove that (and (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_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2325) |c_t_funThread1of4ForFork0_~p~0#1.base|) |t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse1 (store (select .cse3 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (store (store |c_#memory_int| |c_~#a~0.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_~#a~0.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.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_2336) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|)))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (let ((.cse4 (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2325) |c_t_funThread1of4ForFork0_~p~0#1.base|) |t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse5 (store (select .cse7 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (store (store |c_#memory_int| |c_~#a~0.base| .cse5) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store .cse7 |c_~#a~0.base| .cse5) |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_2336) |c_~#a~0.base|))) (store .cse4 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2339 Int)) (or (= (select (store (let ((.cse8 (select (store (let ((.cse11 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2325) |c_t_funThread1of4ForFork0_~p~0#1.base|) |t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332))) (let ((.cse9 (store (select .cse11 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (store (store |c_#memory_int| |c_~#a~0.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse10 (select (store .cse11 |c_~#a~0.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2336) |c_~#a~0.base|))) (store .cse8 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|)))))) is different from false [2024-09-22 12:25:03,605 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (v_ArrVal_2339 Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (store (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_2325) |c_~#a~0.base|) |t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (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_2336) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))))) (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_2325 (Array Int Int)) (v_ArrVal_2330 Int) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2334 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2339 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (store (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_2325) |c_~#a~0.base|) |t_funThread1of4ForFork0_~p~0#1.offset| v_ArrVal_2330)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2334))) (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_2336) |c_~#a~0.base|))) (store .cse2 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2339) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2024-09-22 12:25:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 24 not checked. [2024-09-22 12:25:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905394076] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:25:04,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:25:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 21] total 67 [2024-09-22 12:25:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600647999] [2024-09-22 12:25:04,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:25:04,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-09-22 12:25:04,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:25:04,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-09-22 12:25:04,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3043, Unknown=36, NotChecked=1210, Total=4556 [2024-09-22 12:25:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:25:04,109 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:25:04,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.411764705882353) internal successors, (232), 67 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-22 12:25:04,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:25:09,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:16,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:19,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:21,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:23,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:25,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:28,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:30,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:33,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:35,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:43,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:45,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:47,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:49,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:52,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:55,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:25:57,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:00,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:02,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:04,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:07,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:09,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:11,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:13,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:15,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:18,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:21,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:24,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:28,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:31,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:33,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:35,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:38,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:41,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:43,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:46,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:49,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:52,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:54,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:26:56,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:02,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:04,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:06,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:10,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:12,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:13,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:16,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:17,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:18,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:20,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:22,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:35,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:38,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:27:42,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:44,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:49,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:51,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:54,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:55,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:58,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:27:58,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (let ((.cse1 (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| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (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_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (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_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse4 (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse5 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse9))) (store (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse9) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse5 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse4 (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse11 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713))) (let ((.cse15 (let ((.cse16 (select .cse14 |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|)))))) (let ((.cse12 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse15))) (store (store .cse12 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store (store .cse12 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse14 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse15) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse13 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse11 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))))) is different from false [2024-09-22 12:28:04,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:28:06,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:28:08,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:28:10,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:28:13,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:28:19,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:28:31,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:28:33,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:28:35,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:28:37,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:28:39,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:03,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:06,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:08,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:10,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:13,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:15,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:18,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:20,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:22,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:24,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:43,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:45,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:47,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:49,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:29:51,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:53,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:56,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:29:58,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:00,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:02,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:04,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:06,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:08,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:11,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:13,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:15,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:17,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:19,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:22,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:24,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:30:27,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:39,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:41,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:42,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:30:52,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:02,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:04,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:07,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:09,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:11,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:13,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:31:16,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15