./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 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_70-funloop_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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 21:55:05,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 21:55:05,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 21:55:05,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 21:55:05,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 21:55:05,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 21:55:05,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 21:55:05,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 21:55:05,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 21:55:05,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 21:55:05,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 21:55:05,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 21:55:05,239 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 21:55:05,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 21:55:05,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 21:55:05,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 21:55:05,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 21:55:05,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 21:55:05,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 21:55:05,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 21:55:05,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 21:55:05,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 21:55:05,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 21:55:05,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 21:55:05,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 21:55:05,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 21:55:05,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 21:55:05,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 21:55:05,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 21:55:05,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 21:55:05,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:55:05,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 21:55:05,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 21:55:05,246 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 21:55:05,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 21:55:05,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 21:55:05,247 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 21:55:05,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 21:55:05,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 21:55:05,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 21:55:05,247 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 21:55:05,249 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-18 21:55:05,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 21:55:05,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 21:55:05,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 21:55:05,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 21:55:05,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 21:55:05,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-18 21:55:06,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 21:55:06,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 21:55:06,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-18 21:55:06,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/462ecad18/083400547a0d46498242942aae73357c/FLAG499bde3e4 [2024-10-18 21:55:06,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/462ecad18/083400547a0d46498242942aae73357c [2024-10-18 21:55:06,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 21:55:06,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 21:55:06,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 21:55:06,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 21:55:06,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 21:55:06,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:55:06" (1/1) ... [2024-10-18 21:55:06,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edc021c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:06, skipping insertion in model container [2024-10-18 21:55:06,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:55:06" (1/1) ... [2024-10-18 21:55:06,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 21:55:07,273 WARN L247 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_70-funloop_racefree.i[41323,41336] [2024-10-18 21:55:07,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:55:07,310 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 21:55:07,347 WARN L247 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_70-funloop_racefree.i[41323,41336] [2024-10-18 21:55:07,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:55:07,405 INFO L204 MainTranslator]: Completed translation [2024-10-18 21:55:07,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07 WrapperNode [2024-10-18 21:55:07,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 21:55:07,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 21:55:07,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 21:55:07,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 21:55:07,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,449 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 218 [2024-10-18 21:55:07,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 21:55:07,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 21:55:07,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 21:55:07,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 21:55:07,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 21:55:07,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 21:55:07,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 21:55:07,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 21:55:07,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (1/1) ... [2024-10-18 21:55:07,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:55:07,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:07,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 21:55:07,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 21:55:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-18 21:55:07,552 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-18 21:55:07,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 21:55:07,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 21:55:07,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 21:55:07,554 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 21:55:07,663 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 21:55:07,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 21:55:07,883 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 21:55:07,884 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 21:55:08,019 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 21:55:08,019 INFO L314 CfgBuilder]: Removed 25 assume(true) statements. [2024-10-18 21:55:08,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:55:08 BoogieIcfgContainer [2024-10-18 21:55:08,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 21:55:08,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 21:55:08,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 21:55:08,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 21:55:08,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 09:55:06" (1/3) ... [2024-10-18 21:55:08,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3213984a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:55:08, skipping insertion in model container [2024-10-18 21:55:08,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:07" (2/3) ... [2024-10-18 21:55:08,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3213984a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:55:08, skipping insertion in model container [2024-10-18 21:55:08,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:55:08" (3/3) ... [2024-10-18 21:55:08,028 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-10-18 21:55:08,040 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 21:55:08,041 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-18 21:55:08,041 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 21:55:08,077 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-18 21:55:08,112 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:55:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:55:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:08,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:55:08,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 21:55:08,184 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:55:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:08,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-18 21:55:08,206 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7442657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:55:08,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 21:55:08,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1853550032, now seen corresponding path program 1 times [2024-10-18 21:55:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733621883] [2024-10-18 21:55:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733621883] [2024-10-18 21:55:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733621883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:55:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:55:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:55:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891911902] [2024-10-18 21:55:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:55:08,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 21:55:08,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:08,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:55:08,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:55:08,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:08,929 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:08,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:08,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:08,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 21:55:08,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:08,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1805902569, now seen corresponding path program 1 times [2024-10-18 21:55:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:08,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272681090] [2024-10-18 21:55:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:09,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:09,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272681090] [2024-10-18 21:55:09,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272681090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:09,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023859642] [2024-10-18 21:55:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:09,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:09,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:09,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 21:55:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:09,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 21:55:09,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:09,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:09,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023859642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:09,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-18 21:55:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713665612] [2024-10-18 21:55:09,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 21:55:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 21:55:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 21:55:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:09,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-10-18 21:55:09,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:09,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:09,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 21:55:09,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-18 21:55:09,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -342103024, now seen corresponding path program 2 times [2024-10-18 21:55:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601931333] [2024-10-18 21:55:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601931333] [2024-10-18 21:55:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601931333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900415353] [2024-10-18 21:55:09,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 21:55:09,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:09,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:09,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-18 21:55:09,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 21:55:09,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:55:09,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 21:55:09,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:09,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900415353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:09,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-18 21:55:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413545797] [2024-10-18 21:55:09,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 21:55:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 21:55:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-18 21:55:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:09,732 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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-10-18 21:55:09,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:09,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:09,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:09,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 21:55:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:09,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1712501392, now seen corresponding path program 3 times [2024-10-18 21:55:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123802102] [2024-10-18 21:55:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123802102] [2024-10-18 21:55:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123802102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056832034] [2024-10-18 21:55:10,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 21:55:10,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:10,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:10,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-18 21:55:10,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-18 21:55:10,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:55:10,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-18 21:55:10,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:10,468 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-10-18 21:55:10,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:55:10,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:55:10,557 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-10-18 21:55:10,607 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-10-18 21:55:10,642 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-10-18 21:55:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:10,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:18,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:55:18,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:55:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-18 21:55:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056832034] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:18,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-18 21:55:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923843523] [2024-10-18 21:55:18,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:18,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-18 21:55:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-18 21:55:18,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-18 21:55:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:18,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:18,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:18,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:18,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:18,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:18,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:19,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-18 21:55:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:19,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2049452556, now seen corresponding path program 1 times [2024-10-18 21:55:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:19,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998217938] [2024-10-18 21:55:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998217938] [2024-10-18 21:55:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998217938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148785345] [2024-10-18 21:55:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:19,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:19,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:19,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:19,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 21:55:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:19,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-18 21:55:19,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:55:19,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:55:19,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:55:19,899 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-10-18 21:55:19,944 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-10-18 21:55:19,984 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-10-18 21:55:20,020 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-10-18 21:55:20,110 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-10-18 21:55:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:20,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:28,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-18 21:55:38,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:55:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-18 21:55:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148785345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:38,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-18 21:55:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416086246] [2024-10-18 21:55:38,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:38,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-18 21:55:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-18 21:55:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=326, Unknown=4, NotChecked=78, Total=506 [2024-10-18 21:55:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:38,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:38,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:38,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:38,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:38,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:38,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:39,736 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:55:39,736 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 294 treesize of output 270 [2024-10-18 21:55:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -936332181, now seen corresponding path program 1 times [2024-10-18 21:55:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:55:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-18 21:55:42,108 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:55:42,109 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 1260 treesize of output 1120 [2024-10-18 21:55:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2003208536, now seen corresponding path program 1 times [2024-10-18 21:55:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:55:42,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:55:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:55:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:55:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:55:42,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-18 21:55:42,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-18 21:55:42,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1652070412, now seen corresponding path program 2 times [2024-10-18 21:55:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940006153] [2024-10-18 21:55:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:43,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940006153] [2024-10-18 21:55:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940006153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195696379] [2024-10-18 21:55:43,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 21:55:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:43,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:43,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-10-18 21:55:43,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 21:55:43,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:55:43,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-18 21:55:43,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:43,212 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-10-18 21:55:43,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:55:43,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:55:43,284 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-10-18 21:55:43,374 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-10-18 21:55:43,432 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 31 treesize of output 22 [2024-10-18 21:55:43,473 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-10-18 21:55:46,275 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-10-18 21:55:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:46,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:57,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:55:59,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:01,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:03,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:05,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-18 21:56:07,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_454 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_454) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-18 21:56:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-18 21:56:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195696379] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:56:07,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:56:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-18 21:56:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11013325] [2024-10-18 21:56:07,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:56:07,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-18 21:56:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:56:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-18 21:56:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=326, Unknown=14, NotChecked=258, Total=702 [2024-10-18 21:56:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:56:07,431 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:56:07,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:56:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:56:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:56:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:56:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:56:13,519 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:56:13,520 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 629 treesize of output 561 [2024-10-18 21:56:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1226173221, now seen corresponding path program 1 times [2024-10-18 21:56:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:56:15,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:56:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:56:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:56:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:56:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:56:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:15,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 21:56:15,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-18 21:56:15,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:56:15,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:56:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1136682792, now seen corresponding path program 3 times [2024-10-18 21:56:15,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:56:15,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445217243] [2024-10-18 21:56:15,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:15,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:56:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:56:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445217243] [2024-10-18 21:56:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445217243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:56:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220012395] [2024-10-18 21:56:17,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 21:56:17,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:56:17,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:56:17,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:56:17,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-18 21:56:17,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-18 21:56:17,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:56:17,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-18 21:56:17,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:56:17,380 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-10-18 21:56:17,511 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-18 21:56:17,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-18 21:56:17,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:56:17,737 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-10-18 21:56:17,837 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 31 treesize of output 22 [2024-10-18 21:56:20,945 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-10-18 21:56:25,177 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 72 treesize of output 57 [2024-10-18 21:56:33,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 77 [2024-10-18 21:56:56,054 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 82 [2024-10-18 21:56:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:56,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:57:21,578 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:23,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:25,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:27,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:29,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-10-18 21:57:29,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-18 21:57:31,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 21:57:33,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_639 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 21:57:35,662 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_639 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-18 21:57:37,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_637) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_639 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-18 21:57:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-18 21:57:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220012395] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:57:37,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:57:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-18 21:57:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700624918] [2024-10-18 21:57:37,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:57:37,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-18 21:57:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:57:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-18 21:57:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=676, Unknown=43, NotChecked=650, Total=1560 [2024-10-18 21:57:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:57:37,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:57:37,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:57:37,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:57:39,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:57:41,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] [2024-10-18 21:57:46,396 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-10-18 21:57:48,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:57:50,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:57:54,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:57:56,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:57:57,908 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-10-18 21:57:59,913 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-10-18 21:58:17,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:58:18,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:58:19,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:58:21,767 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-10-18 21:58:40,582 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:58:40,583 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 629 treesize of output 561 [2024-10-18 21:58:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1345752871, now seen corresponding path program 1 times [2024-10-18 21:58:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:42,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:58:42,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:58:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:58:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:58:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:58:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-18 21:58:42,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-18 21:58:42,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-10-18 21:58:42,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:42,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash -514855942, now seen corresponding path program 4 times [2024-10-18 21:58:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:42,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542368091] [2024-10-18 21:58:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:03:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:03:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:03:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542368091] [2024-10-18 22:03:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542368091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:03:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557995614] [2024-10-18 22:03:23,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 22:03:23,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:03:23,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:03:23,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 22:03:23,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-18 22:03:23,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 22:03:23,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 22:03:23,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-18 22:03:23,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:03:23,755 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-10-18 22:03:23,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 22:03:23,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 22:03:24,091 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-10-18 22:03:24,266 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-10-18 22:03:24,420 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 31 treesize of output 22 [2024-10-18 22:03:28,189 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-10-18 22:03:31,998 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 72 treesize of output 57 [2024-10-18 22:03:49,984 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 79 treesize of output 66 [2024-10-18 22:03:59,118 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 230 treesize of output 189 [2024-10-18 22:04:44,854 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 291 treesize of output 244 [2024-10-18 22:04:52,992 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 490 treesize of output 417 [2024-10-18 22:04:56,077 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 579 treesize of output 504 [2024-10-18 22:05:48,361 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 1078 treesize of output 934 [2024-10-18 22:05:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 120 refuted. 22 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:05:49,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:06:35,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:06:37,884 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:06:39,929 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:06:39,946 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:06:42,003 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|))))) is different from false [2024-10-18 22:06:44,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-18 22:06:46,094 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ .cse0 |c_~#cache~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:06:48,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_921 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:06:50,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:06:52,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:06:54,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse3 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:06:56,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse3 |c_~#cache~0.offset|))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_917 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:06:58,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:07:00,633 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:07:02,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse3 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse3 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:07:04,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse3 |c_~#cache~0.offset|))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_915 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse2 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:07:07,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 84)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ v_ArrVal_915 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse1 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |~#cache~0.offset| .cse2 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))))) is different from false [2024-10-18 22:07:09,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 84)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|))) (store (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ v_ArrVal_915 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse1 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |~#cache~0.offset| .cse2 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))))) is different from false [2024-10-18 22:07:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-18 22:07:10,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557995614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:07:10,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:07:10,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 66 [2024-10-18 22:07:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039469915] [2024-10-18 22:07:10,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:07:10,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-18 22:07:10,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:10,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-18 22:07:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2038, Unknown=109, NotChecked=1998, Total=4422 [2024-10-18 22:07:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:10,229 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:10,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.253731343283582) internal successors, (285), 66 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-18 22:07:10,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:13,737 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-10-18 22:07:16,058 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-10-18 22:07:17,696 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-10-18 22:07:19,709 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-10-18 22:07:21,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:23,658 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-10-18 22:07:25,672 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-10-18 22:07:27,690 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-10-18 22:07:38,800 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-10-18 22:07:54,357 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-10-18 22:07:56,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:58,404 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-10-18 22:08:00,433 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-10-18 22:08:08,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:15,558 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-10-18 22:08:21,288 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-10-18 22:08:23,299 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-10-18 22:08:25,313 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-10-18 22:08:27,326 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-10-18 22:08:29,338 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-10-18 22:08:31,366 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-10-18 22:08:52,403 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-10-18 22:08:54,410 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-10-18 22:09:05,598 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]