./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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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-17 11:38:04,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 11:38:04,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 11:38:04,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 11:38:04,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 11:38:04,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 11:38:04,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 11:38:04,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 11:38:04,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 11:38:04,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 11:38:04,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 11:38:04,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 11:38:04,348 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 11:38:04,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 11:38:04,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 11:38:04,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 11:38:04,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 11:38:04,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 11:38:04,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 11:38:04,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 11:38:04,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 11:38:04,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 11:38:04,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 11:38:04,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 11:38:04,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 11:38:04,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 11:38:04,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 11:38:04,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 11:38:04,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 11:38:04,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 11:38:04,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 11:38:04,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 11:38:04,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 11:38:04,357 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 11:38:04,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 11:38:04,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 11:38:04,358 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 11:38:04,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 11:38:04,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 11:38:04,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 11:38:04,358 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 11:38:04,359 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-17 11:38:04,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 11:38:04,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 11:38:04,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 11:38:04,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 11:38:04,579 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 11:38:04,580 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-17 11:38:05,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 11:38:06,098 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 11:38:06,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-17 11:38:06,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/46d40ac73/765dd8f74d234b82832ba73e74a67173/FLAGb377472b4 [2024-10-17 11:38:06,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/46d40ac73/765dd8f74d234b82832ba73e74a67173 [2024-10-17 11:38:06,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 11:38:06,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 11:38:06,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 11:38:06,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 11:38:06,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 11:38:06,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:38:06" (1/1) ... [2024-10-17 11:38:06,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d6b28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:06, skipping insertion in model container [2024-10-17 11:38:06,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:38:06" (1/1) ... [2024-10-17 11:38:06,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 11:38:06,889 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-17 11:38:06,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 11:38:06,923 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 11:38:06,960 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-17 11:38:06,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 11:38:07,011 INFO L204 MainTranslator]: Completed translation [2024-10-17 11:38:07,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07 WrapperNode [2024-10-17 11:38:07,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 11:38:07,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 11:38:07,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 11:38:07,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 11:38:07,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,050 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 218 [2024-10-17 11:38:07,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 11:38:07,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 11:38:07,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 11:38:07,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 11:38:07,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 11:38:07,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 11:38:07,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 11:38:07,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 11:38:07,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (1/1) ... [2024-10-17 11:38:07,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 11:38:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:07,120 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-17 11:38:07,124 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-17 11:38:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 11:38:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 11:38:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 11:38:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 11:38:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 11:38:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 11:38:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 11:38:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 11:38:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 11:38:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 11:38:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 11:38:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 11:38:07,163 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 11:38:07,271 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 11:38:07,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 11:38:07,444 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 11:38:07,444 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 11:38:07,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 11:38:07,682 INFO L314 CfgBuilder]: Removed 25 assume(true) statements. [2024-10-17 11:38:07,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:38:07 BoogieIcfgContainer [2024-10-17 11:38:07,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 11:38:07,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 11:38:07,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 11:38:07,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 11:38:07,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 11:38:06" (1/3) ... [2024-10-17 11:38:07,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:38:07, skipping insertion in model container [2024-10-17 11:38:07,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:38:07" (2/3) ... [2024-10-17 11:38:07,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:38:07, skipping insertion in model container [2024-10-17 11:38:07,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:38:07" (3/3) ... [2024-10-17 11:38:07,689 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-10-17 11:38:07,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 11:38:07,701 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-17 11:38:07,701 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 11:38:07,734 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 11:38:07,774 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 11:38:07,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 11:38:07,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:07,776 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-17 11:38:07,779 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-17 11:38:07,857 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 11:38:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:07,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 11:38:07,881 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;@211e76ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 11:38:07,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 11:38:08,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:08,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1853550032, now seen corresponding path program 1 times [2024-10-17 11:38:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:38:08,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429476020] [2024-10-17 11:38:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:08,531 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-17 11:38:08,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:38:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429476020] [2024-10-17 11:38:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429476020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 11:38:08,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 11:38:08,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 11:38:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276535421] [2024-10-17 11:38:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 11:38:08,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 11:38:08,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:38:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 11:38:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 11:38:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:08,557 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:38:08,558 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-17 11:38:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 11:38:08,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1805902569, now seen corresponding path program 1 times [2024-10-17 11:38:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:38:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118075332] [2024-10-17 11:38:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:08,680 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-17 11:38:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:38:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118075332] [2024-10-17 11:38:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118075332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:38:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431017980] [2024-10-17 11:38:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:08,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:38:08,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:08,683 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-17 11:38:08,690 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-17 11:38:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:08,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 11:38:08,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:38:08,772 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-17 11:38:08,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:38:08,790 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-17 11:38:08,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431017980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:38:08,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:38:08,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 11:38:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60899564] [2024-10-17 11:38:08,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:38:08,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 11:38:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:38:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 11:38:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 11:38:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:08,793 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:38:08,794 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-17 11:38:08,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:08,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:08,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 11:38:09,065 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-17 11:38:09,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:09,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash -342103024, now seen corresponding path program 2 times [2024-10-17 11:38:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:38:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641355431] [2024-10-17 11:38:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:09,180 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-17 11:38:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:38:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641355431] [2024-10-17 11:38:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641355431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:38:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757780223] [2024-10-17 11:38:09,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:38:09,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:38:09,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:09,183 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-17 11:38:09,188 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-17 11:38:09,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:38:09,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:38:09,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 11:38:09,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:38:09,306 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-17 11:38:09,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:38:09,361 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-17 11:38:09,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757780223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:38:09,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:38:09,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 11:38:09,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586338574] [2024-10-17 11:38:09,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:38:09,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 11:38:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:38:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 11:38:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 11:38:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:09,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:38:09,366 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-17 11:38:09,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:09,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:09,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:09,440 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-17 11:38:09,628 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-17 11:38:09,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:09,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1712501392, now seen corresponding path program 3 times [2024-10-17 11:38:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:38:09,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429136374] [2024-10-17 11:38:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:09,859 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-17 11:38:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:38:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429136374] [2024-10-17 11:38:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429136374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:38:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742176277] [2024-10-17 11:38:09,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 11:38:09,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:38:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:09,862 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-17 11:38:09,865 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-17 11:38:09,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 11:38:09,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:38:09,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 11:38:09,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:38:09,965 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-17 11:38:10,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:38:10,030 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-17 11:38:10,048 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-17 11:38:10,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-17 11:38:10,120 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-17 11:38:10,136 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-17 11:38:10,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:38:16,182 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-17 11:38:18,194 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-17 11:38:18,273 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-17 11:38:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742176277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:38:18,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:38:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 11:38:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690308896] [2024-10-17 11:38:18,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:38:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 11:38:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:38:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 11:38:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-17 11:38:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:18,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:38:18,276 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-17 11:38:18,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:18,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:18,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:18,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:18,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 11:38:18,629 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-17 11:38:18,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2049452556, now seen corresponding path program 1 times [2024-10-17 11:38:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:38:18,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196198430] [2024-10-17 11:38:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:19,143 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-17 11:38:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:38:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196198430] [2024-10-17 11:38:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196198430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:38:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371892428] [2024-10-17 11:38:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:38:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:19,148 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-17 11:38:19,151 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-17 11:38:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:19,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-17 11:38:19,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:38:19,259 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-17 11:38:19,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:38:19,319 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-17 11:38:19,340 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-17 11:38:19,396 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-17 11:38:19,439 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-17 11:38:19,477 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-17 11:38:19,549 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-17 11:38:19,566 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-17 11:38:19,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:38:29,645 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-17 11:38:35,693 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-17 11:38:35,769 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-17 11:38:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371892428] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:38:35,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:38:35,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-17 11:38:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640874494] [2024-10-17 11:38:35,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:38:35,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-17 11:38:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:38:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-17 11:38:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=326, Unknown=4, NotChecked=78, Total=506 [2024-10-17 11:38:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:35,772 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:38:35,773 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-17 11:38:35,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:35,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:35,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:35,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:35,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:38:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:38:37,688 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-17 11:38:37,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:38:37,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:37,951 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:38:37,951 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 29 treesize of output 25 [2024-10-17 11:38:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1610656064, now seen corresponding path program 1 times [2024-10-17 11:38:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:37,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 11:38:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 11:38:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 11:38:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 11:38:38,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-17 11:38:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:38,140 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:38:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-17 11:38:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:38:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:38:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:38:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:38:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:38:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:38:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:38:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:38:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:38:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-17 11:38:38,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:38:38,507 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:38:38,508 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 1276 treesize of output 1136 [2024-10-17 11:38:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2003208486, now seen corresponding path program 1 times [2024-10-17 11:38:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:38,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:38:38,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:38:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:38:38,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:38:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1652070412, now seen corresponding path program 2 times [2024-10-17 11:38:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:38:38,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085869769] [2024-10-17 11:38:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:38:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:38:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:38:39,925 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-17 11:38:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:38:39,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085869769] [2024-10-17 11:38:39,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085869769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:38:39,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651779356] [2024-10-17 11:38:39,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:38:39,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:38:39,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:38:39,928 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-17 11:38:39,929 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-17 11:38:40,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:38:40,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:38:40,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-17 11:38:40,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:38:40,033 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-17 11:38:40,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:38:40,091 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-17 11:38:40,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 11:38:40,203 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-17 11:38:40,265 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-17 11:38:40,303 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-17 11:38:42,763 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-17 11:38:42,788 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-17 11:38:42,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:39:00,577 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-17 11:39:02,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (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_538) |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-17 11:39:03,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (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| (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_538) |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-17 11:39:05,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_536 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_536 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |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-17 11:39:07,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_536 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_536 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |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-17 11:39:09,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_536 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_534) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_536 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-17 11:39:10,122 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-17 11:39:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651779356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:39:10,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:39:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 30 [2024-10-17 11:39:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733689011] [2024-10-17 11:39:10,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:39:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-17 11:39:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:39:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-17 11:39:10,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=506, Unknown=17, NotChecked=306, Total=930 [2024-10-17 11:39:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:39:10,125 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:39:10,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 30 states have internal predecessors, (106), 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-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:39:10,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:39:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:39:11,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 11:39:12,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:39:12,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:39:12,066 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:39:12,067 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 2562 treesize of output 2278 [2024-10-17 11:39:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1226173183, now seen corresponding path program 1 times [2024-10-17 11:39:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:39:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:39:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:39:12,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:39:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:39:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:39:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1136682792, now seen corresponding path program 3 times [2024-10-17 11:39:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:39:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691886742] [2024-10-17 11:39:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:39:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:39:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:39:16,330 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-17 11:39:16,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:39:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691886742] [2024-10-17 11:39:16,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691886742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:39:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176495784] [2024-10-17 11:39:16,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 11:39:16,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:39:16,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:39:16,332 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-17 11:39:16,333 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-17 11:39:16,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 11:39:16,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:39:16,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-17 11:39:16,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:39:16,474 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-17 11:39:16,606 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-17 11:39:16,606 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-17 11:39:16,650 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-17 11:39:16,816 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-17 11:39:16,937 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-17 11:39:19,759 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-17 11:39:23,305 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-17 11:39:31,480 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-17 11:39:47,902 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-17 11:39:47,952 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-17 11:39:47,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:40:17,650 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-17 11:40:19,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (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_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-17 11:40:21,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (= (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_724) |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| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:40:23,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 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_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |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| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:40:25,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= 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_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-10-17 11:40:25,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 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|) (= 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_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 11:40:27,740 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int 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) (v_ArrVal_721 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|) (= (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_721 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |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| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:40:29,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 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) (v_ArrVal_721 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|) (= (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_718 (- 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_721 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |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| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:40:31,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 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) (v_ArrVal_721 Int)) (or (= (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_718 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |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| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |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-17 11:40:33,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_718 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) (v_ArrVal_721 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_717) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_718 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |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-17 11:40:34,214 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-17 11:40:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176495784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:40:34,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:40:34,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2024-10-17 11:40:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865126114] [2024-10-17 11:40:34,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:40:34,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-17 11:40:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:40:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-17 11:40:34,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=888, Unknown=42, NotChecked=710, Total=1806 [2024-10-17 11:40:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:40:34,218 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:40:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 42 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-17 11:40:34,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:40:34,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:40:34,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:40:34,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:40:34,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:40:34,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:40:34,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:40:34,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:40:39,928 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-17 11:40:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:40:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:40:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:40:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:40:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:40:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:40:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:40:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-17 11:40:45,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-17 11:40:45,669 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,SelfDestructingSolverStorable9 [2024-10-17 11:40:45,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:40:45,739 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:40:45,739 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-17 11:40:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1702530348, now seen corresponding path program 1 times [2024-10-17 11:40:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:40:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:40:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:40:45,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:40:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:40:45,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:40:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1393116448, now seen corresponding path program 4 times [2024-10-17 11:40:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:40:45,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611471348] [2024-10-17 11:40:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:40:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:40:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:44:03,245 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-17 11:44:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:44:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611471348] [2024-10-17 11:44:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611471348] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:44:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973672811] [2024-10-17 11:44:03,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 11:44:03,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:44:03,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:44:03,249 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-17 11:44:03,250 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-17 11:44:04,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 11:44:04,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:44:04,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-17 11:44:04,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:44:04,473 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-17 11:44:04,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:44:04,595 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-17 11:44:04,671 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-17 11:44:04,817 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-17 11:44:04,935 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-17 11:44:07,498 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-17 11:44:07,689 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 54 treesize of output 43 [2024-10-17 11:44:18,371 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 44 treesize of output 35 [2024-10-17 11:44:24,981 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 179 treesize of output 154 [2024-10-17 11:44:40,275 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 356 treesize of output 311 [2024-10-17 11:45:23,447 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 365 treesize of output 320 [2024-10-17 11:45:49,698 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 1715 treesize of output 1524 [2024-10-17 11:47:45,888 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse83 (mod |c_~#cache~0.offset| 28))) (let ((.cse54 (* .cse83 27))) (let ((.cse82 (div (+ .cse54 |c_~#cache~0.offset|) 28)) (.cse33 (mod (* |c_~#cache~0.offset| 27) 28)) (.cse21 (div (* (- 1) |c_~#cache~0.offset|) 28))) (let ((.cse29 (* .cse21 28)) (.cse34 (* (- 1) .cse33)) (.cse7 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse58 (<= .cse83 0)) (.cse50 (<= 1 .cse83)) (.cse36 (+ |c_t_funThread1of1ForFork0_~i~0#1| .cse82)) (.cse0 ((as const (Array Int Int)) 0)) (.cse39 (* (- 27) .cse83)) (.cse8 (select |c_#memory_int| 4)) (.cse40 (* 28 .cse82))) (or (exists ((v_DerPreprocessor_23 Int) (v_prenex_12 Int) (v_prenex_3 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse2 (+ (* 28 v_prenex_3) |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse0 v_prenex_12 (select .cse8 v_prenex_12)) .cse2 (select .cse8 .cse2))) (.cse6 (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (let ((.cse1 (store (let ((.cse4 (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse6 1)))) (store (store .cse0 v_prenex_12 (select .cse4 v_prenex_12)) .cse2 (select .cse4 .cse2))) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_DerPreprocessor_23))) (let ((.cse3 (select .cse1 .cse2))) (= (select (store (store (store .cse0 v_prenex_12 (select .cse1 v_prenex_12)) .cse2 .cse3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_DerPreprocessor_23 1)) .cse2) .cse3))) (<= (+ 3 v_prenex_3) |c_t_funThread1of1ForFork0_~i~0#1|) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse7) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_12)) (<= (+ v_prenex_12 28) .cse2) (= (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) .cse8))))) (exists ((v_subst_24 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse11 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28)))) (let ((.cse12 (select .cse8 .cse11))) (let ((.cse9 (store (store .cse0 .cse11 .cse12) v_subst_24 (select .cse8 v_subst_24))) (.cse10 (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse7) (= (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse10) .cse8) (= (select (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse10 1)) .cse11) .cse12) (<= (+ v_subst_24 28) .cse11) (<= (+ 3 |v_t_funThread1of1ForFork0_~i~0#1_33|) |c_t_funThread1of1ForFork0_~i~0#1|) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_24))))))) (exists ((v_prenex_16 Int) (v_prenex_17 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_DerPreprocessor_21 Int)) (let ((.cse14 (+ (* v_prenex_17 28) |c_~#cache~0.offset|)) (.cse18 (select .cse8 v_prenex_16))) (let ((.cse19 (store (store .cse0 .cse14 (select .cse8 .cse14)) v_prenex_16 .cse18)) (.cse20 (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse17 (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse20 1)))) (let ((.cse16 (select .cse17 v_prenex_16))) (and (let ((.cse13 (store (store (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_DerPreprocessor_21) .cse14 (select .cse17 .cse14)) v_prenex_16 .cse16))) (let ((.cse15 (select .cse13 .cse14))) (= (select (store (store (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse14 .cse15) v_prenex_16 (+ .cse16 1)) .cse14) .cse15))) (= .cse16 .cse18) (<= (+ 56 v_prenex_16) .cse7) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse14) (<= (+ 3 v_prenex_17) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse20) .cse8))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (v_prenex_2 Int) (v_y_17 Int) (v_y_19 Int)) (let ((.cse27 (* v_y_17 28))) (let ((.cse31 (+ 28 .cse27 .cse34))) (let ((.cse30 (store (store .cse0 v_prenex_2 (select .cse8 v_prenex_2)) v_prenex_6 (select .cse8 v_prenex_6))) (.cse32 (select .cse8 .cse31)) (.cse28 (* v_y_19 28))) (and (<= (+ .cse21 v_y_19 v_y_17 4) |c_t_funThread1of1ForFork0_~i~0#1|) (<= (+ 56 v_prenex_6) .cse7) (let ((.cse26 (store .cse30 .cse31 (+ .cse32 1)))) (let ((.cse23 (+ 28 .cse27 |c_~#cache~0.offset| .cse28 .cse29)) (.cse25 (select .cse26 v_prenex_6))) (let ((.cse24 (store (store (store .cse0 v_prenex_2 (select .cse26 v_prenex_2)) .cse23 v_DerPreprocessor_22) v_prenex_6 .cse25))) (let ((.cse22 (select .cse24 v_prenex_2))) (= (select (store (store (store .cse0 v_prenex_2 .cse22) .cse23 (select .cse24 .cse23)) v_prenex_6 (+ .cse25 1)) v_prenex_2) .cse22))))) (not (= (+ .cse33 v_prenex_6) (+ 28 .cse27))) (= (store .cse30 .cse31 .cse32) .cse8) (<= 1 (+ .cse33 .cse28)) (<= v_prenex_2 (+ .cse27 |c_~#cache~0.offset| .cse28 .cse29)) (<= v_y_19 0)))))) (exists ((v_prenex_18 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse35 (+ (* v_prenex_18 28) |c_~#cache~0.offset|))) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse35) (<= (+ 3 v_prenex_18) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store (store .cse0 .cse35 (select .cse8 .cse35)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse8)))) (and (or (exists ((v_prenex_4 Int) (v_y_22 Int)) (let ((.cse38 (* v_y_22 28))) (and (<= (+ v_y_22 30) .cse36) (= (let ((.cse37 (+ .cse38 756 .cse39))) (store (store .cse0 v_prenex_4 (select .cse8 v_prenex_4)) .cse37 (select .cse8 .cse37))) .cse8) (<= (+ .cse40 v_prenex_4) (+ .cse38 728 |c_~#cache~0.offset|))))) (exists ((v_prenex_5 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse41 (* 28 v_prenex_5))) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse40) (+ 728 .cse41 |c_~#cache~0.offset|)) (= (store (let ((.cse42 (+ 756 .cse39 .cse41))) (store .cse0 .cse42 (select .cse8 .cse42))) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse8) (<= (+ 30 v_prenex_5) .cse36)))) (exists ((v_prenex_7 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_prenex_8 Int)) (let ((.cse43 (* 28 v_prenex_8))) (let ((.cse46 (+ 756 .cse39 .cse43))) (let ((.cse45 (select .cse8 v_prenex_7)) (.cse47 (select .cse8 .cse46))) (let ((.cse48 (store (store .cse0 v_prenex_7 .cse45) .cse46 .cse47)) (.cse49 (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse44 (store .cse48 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse49 1)))) (and (<= (+ 30 v_prenex_8) .cse36) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse7) (<= (+ .cse40 v_prenex_7) (+ 728 .cse43 |c_~#cache~0.offset|)) (= (select .cse44 v_prenex_7) .cse45) (= (select .cse44 .cse46) .cse47) (= (store .cse48 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse49) .cse8))))))))) .cse50) (and (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_y_10 Int)) (let ((.cse52 (* v_y_10 28))) (and (<= (+ v_y_10 3) .cse36) (= (store (let ((.cse51 (+ .cse52 .cse39))) (store .cse0 .cse51 (select .cse8 .cse51))) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse8) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28 .cse40) (+ .cse52 |c_~#cache~0.offset|))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse53 (* v_prenex_10 28))) (and (not (= .cse53 (+ .cse54 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse7) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_9)) (<= (+ 3 v_prenex_10) .cse36) (= (store (let ((.cse55 (+ .cse39 .cse53))) (store (store .cse0 v_prenex_9 (select .cse8 v_prenex_9)) .cse55 (select .cse8 .cse55))) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse8) (<= (+ 28 .cse40 v_prenex_9) (+ .cse53 |c_~#cache~0.offset|))))) (exists ((v_y_12 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (let ((.cse56 (* v_y_12 28))) (and (<= (+ v_y_12 3) .cse36) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28 .cse40) (+ .cse56 |c_~#cache~0.offset|)) (= (let ((.cse57 (+ .cse39 .cse56))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse8 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) .cse57 (select .cse8 .cse57))) .cse8))))) .cse58) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (v_prenex_2 Int) (v_y_17 Int) (v_y_19 Int)) (let ((.cse68 (* v_y_17 28))) (let ((.cse59 (* v_y_19 28)) (.cse66 (+ .cse68 .cse34))) (let ((.cse65 (store (store .cse0 v_prenex_2 (select .cse8 v_prenex_2)) v_prenex_6 (select .cse8 v_prenex_6))) (.cse67 (select .cse8 .cse66)) (.cse61 (+ .cse68 |c_~#cache~0.offset| .cse59 .cse29))) (and (<= 0 v_y_19) (<= (+ 56 v_prenex_6) .cse7) (<= (+ .cse33 .cse59) 0) (<= (+ .cse21 v_y_19 v_y_17 3) |c_t_funThread1of1ForFork0_~i~0#1|) (let ((.cse64 (store .cse65 .cse66 (+ .cse67 1)))) (let ((.cse63 (select .cse64 v_prenex_6))) (let ((.cse62 (store (store (store .cse0 v_prenex_2 (select .cse64 v_prenex_2)) .cse61 v_DerPreprocessor_22) v_prenex_6 .cse63))) (let ((.cse60 (select .cse62 v_prenex_2))) (= (select (store (store (store .cse0 v_prenex_2 .cse60) .cse61 (select .cse62 .cse61)) v_prenex_6 (+ .cse63 1)) v_prenex_2) .cse60))))) (= (store .cse65 .cse66 .cse67) .cse8) (<= (+ 28 v_prenex_2) .cse61) (not (= (+ .cse33 v_prenex_6) .cse68))))))) (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse71 (+ (* v_prenex_15 28) |c_~#cache~0.offset|))) (let ((.cse69 (store (store (store .cse0 v_prenex_14 (select .cse8 v_prenex_14)) .cse71 (select .cse8 .cse71)) v_prenex_13 (select .cse8 v_prenex_13))) (.cse70 (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse77 (store .cse69 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse70 1)))) (let ((.cse75 (select .cse77 v_prenex_13))) (let ((.cse76 (store (store (store .cse0 v_prenex_14 (select .cse77 v_prenex_14)) .cse71 (select .cse77 .cse71)) v_prenex_13 .cse75))) (let ((.cse72 (select .cse76 v_prenex_14)) (.cse74 (select .cse76 .cse71))) (let ((.cse73 (store (store (store .cse0 v_prenex_14 .cse72) .cse71 .cse74) v_prenex_13 (+ .cse75 1)))) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse7) (= (store .cse69 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse70) .cse8) (<= (+ 56 v_prenex_13) .cse7) (<= (+ 3 v_prenex_15) |c_t_funThread1of1ForFork0_~i~0#1|) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_14)) (not (= .cse71 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= .cse72 (select .cse73 v_prenex_14)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_13)) (= .cse74 (select .cse73 .cse71)) (<= (+ v_prenex_14 28) .cse71)))))))))) (and .cse58 (exists ((v_y_27 Int) (v_prenex_11 Int)) (let ((.cse79 (* v_y_27 28))) (and (= (let ((.cse78 (+ .cse39 .cse79))) (store (store .cse0 v_prenex_11 (select .cse8 v_prenex_11)) .cse78 (select .cse8 .cse78))) .cse8) (<= (+ v_prenex_11 28 .cse40) (+ |c_~#cache~0.offset| .cse79)) (<= (+ v_y_27 3) .cse36))))) (and .cse50 (exists ((v_y_27 Int) (v_prenex_11 Int)) (let ((.cse81 (* v_y_27 28))) (and (<= (+ v_y_27 30) .cse36) (= (let ((.cse80 (+ 756 .cse39 .cse81))) (store (store .cse0 v_prenex_11 (select .cse8 v_prenex_11)) .cse80 (select .cse8 .cse80))) .cse8) (<= (+ v_prenex_11 .cse40) (+ 728 |c_~#cache~0.offset| .cse81))))))))))) (= |c_~#cache~0.base| 4)) is different from false [2024-10-17 11:48:18,264 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 3694 treesize of output 3228 [2024-10-17 11:48:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 117 refuted. 21 times theorem prover too weak. 55 trivial. 4 not checked. [2024-10-17 11:48:20,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:48:58,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:49:00,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 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_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:49:02,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= (select (select (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_995 (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:49:04,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2024-10-17 11:49:06,504 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2024-10-17 11:49:08,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_993 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2024-10-17 11:49:10,558 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_993 (Array Int Int))) (or (= (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_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:49:12,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (v_ArrVal_993 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 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_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2024-10-17 11:49:14,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0)))) is different from false [2024-10-17 11:49:14,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_38| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))))) is different from false [2024-10-17 11:49:16,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-17 11:49:18,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_988 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-17 11:49:20,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-17 11:49:23,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 11:49:25,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (= (select (select (store (let ((.cse0 (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| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< (+ .cse2 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse2 |c_~#cache~0.offset|))))) is different from false [2024-10-17 11:49:27,288 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (= (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_984 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-17 11:49:29,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| 28)) (< (+ |~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| (+ v_ArrVal_984 (- 1))) .cse0 (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 |~#cache~0.offset| .cse1))))) is different from false [2024-10-17 11:49:31,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse0 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| 28)) (< (+ |~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_983) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| (+ v_ArrVal_984 (- 1))) .cse0 (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 |~#cache~0.offset| .cse1))))) is different from false [2024-10-17 11:49:33,089 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-17 11:49:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973672811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:49:33,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:49:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 66 [2024-10-17 11:49:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700524161] [2024-10-17 11:49:33,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:49:33,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-17 11:49:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:49:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-17 11:49:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1875, Unknown=130, NotChecked=2090, Total=4422 [2024-10-17 11:49:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:49:33,099 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:49:33,099 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-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-17 11:49:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:49:35,106 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-17 11:49:37,131 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-17 11:49:39,158 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-17 11:49:47,272 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-17 11:49:49,293 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-17 11:49:51,322 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-17 11:49:53,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:49:55,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:49:57,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-17 11:49:59,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:50:01,451 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-17 11:50:13,649 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-17 11:50:15,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:50:17,759 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-17 11:50:19,787 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-17 11:50:21,797 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-17 11:50:34,019 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-17 11:50:36,041 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-17 11:50:38,069 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-17 11:50:40,096 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-17 11:50:42,107 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-17 11:50:44,674 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-17 11:50:46,694 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-17 11:50:48,718 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-17 11:50:50,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:50:52,746 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-17 11:51:05,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:51:11,028 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]