./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --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/pthread-ext/37_stack_lock_p0_vs_concur-pthread.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 d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --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-18 11:08:18,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 11:08:18,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 11:08:18,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 11:08:18,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 11:08:18,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 11:08:18,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 11:08:18,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 11:08:18,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 11:08:18,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 11:08:18,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 11:08:18,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 11:08:18,380 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 11:08:18,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 11:08:18,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 11:08:18,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 11:08:18,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 11:08:18,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 11:08:18,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 11:08:18,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 11:08:18,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 11:08:18,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 11:08:18,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 11:08:18,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 11:08:18,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 11:08:18,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 11:08:18,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 11:08:18,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 11:08:18,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 11:08:18,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 11:08:18,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 11:08:18,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 11:08:18,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 11:08:18,390 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 11:08:18,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 11:08:18,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 11:08:18,391 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 11:08:18,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 11:08:18,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 11:08:18,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 11:08:18,392 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 11:08:18,393 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 -> d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-18 11:08:18,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 11:08:18,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 11:08:18,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 11:08:18,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 11:08:18,656 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 11:08:18,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-10-18 11:08:20,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 11:08:20,410 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 11:08:20,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-10-18 11:08:20,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5957703be/f5aea57807a74377ae733ce82712e818/FLAGa931d169c [2024-10-18 11:08:20,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5957703be/f5aea57807a74377ae733ce82712e818 [2024-10-18 11:08:20,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 11:08:20,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 11:08:20,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 11:08:20,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 11:08:20,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 11:08:20,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:20,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d885cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20, skipping insertion in model container [2024-10-18 11:08:20,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:20,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 11:08:20,855 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-10-18 11:08:20,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 11:08:20,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 11:08:20,936 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-10-18 11:08:20,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 11:08:20,991 INFO L204 MainTranslator]: Completed translation [2024-10-18 11:08:20,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20 WrapperNode [2024-10-18 11:08:20,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 11:08:20,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 11:08:20,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 11:08:20,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 11:08:21,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,034 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-10-18 11:08:21,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 11:08:21,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 11:08:21,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 11:08:21,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 11:08:21,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 11:08:21,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 11:08:21,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 11:08:21,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 11:08:21,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (1/1) ... [2024-10-18 11:08:21,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 11:08:21,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:21,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 11:08:21,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 11:08:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 11:08:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 11:08:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 11:08:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 11:08:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-18 11:08:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 11:08:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 11:08:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 11:08:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 11:08:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-18 11:08:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 11:08:21,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 11:08:21,165 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 11:08:21,324 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 11:08:21,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 11:08:21,595 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 11:08:21,596 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 11:08:21,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 11:08:21,720 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-18 11:08:21,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:08:21 BoogieIcfgContainer [2024-10-18 11:08:21,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 11:08:21,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 11:08:21,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 11:08:21,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 11:08:21,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 11:08:20" (1/3) ... [2024-10-18 11:08:21,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caa3386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 11:08:21, skipping insertion in model container [2024-10-18 11:08:21,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:08:20" (2/3) ... [2024-10-18 11:08:21,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caa3386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 11:08:21, skipping insertion in model container [2024-10-18 11:08:21,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:08:21" (3/3) ... [2024-10-18 11:08:21,734 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-10-18 11:08:21,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 11:08:21,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 11:08:21,753 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 11:08:21,793 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 11:08:21,838 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 11:08:21,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 11:08:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:21,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 11:08:21,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 11:08:21,934 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 11:08:21,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:21,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 11:08:21,966 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;@57c55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 11:08:21,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 11:08:22,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:22,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 253978131, now seen corresponding path program 1 times [2024-10-18 11:08:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:22,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835830731] [2024-10-18 11:08:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835830731] [2024-10-18 11:08:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835830731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:23,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:08:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698385627] [2024-10-18 11:08:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:23,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:08:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:23,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:08:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:08:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:23,145 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:23,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:23,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:23,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 11:08:23,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 11:08:23,845 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-18 11:08:23,847 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 11:08:23,851 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 11:08:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 11:08:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:23,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 11:08:23,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-18 11:08:23,895 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 11:08:23,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:23,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 11:08:23,897 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;@57c55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 11:08:23,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 11:08:24,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:08:24,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash -740144592, now seen corresponding path program 1 times [2024-10-18 11:08:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:24,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986101231] [2024-10-18 11:08:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:24,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986101231] [2024-10-18 11:08:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986101231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:24,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:24,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:08:24,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708382272] [2024-10-18 11:08:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:24,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:08:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:08:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:08:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:24,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:24,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:24,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 11:08:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 11:08:24,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:08:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1468636501, now seen corresponding path program 1 times [2024-10-18 11:08:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605791516] [2024-10-18 11:08:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605791516] [2024-10-18 11:08:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605791516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 11:08:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206614071] [2024-10-18 11:08:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 11:08:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:24,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 11:08:24,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-18 11:08:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:24,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:24,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 11:08:24,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 11:08:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:24,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-18 11:08:24,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:08:24,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash -716612086, now seen corresponding path program 1 times [2024-10-18 11:08:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858596056] [2024-10-18 11:08:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:24,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:08:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:25,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 11:08:25,002 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 11:08:25,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 11:08:25,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-18 11:08:25,006 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 11:08:25,006 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 11:08:25,007 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 11:08:25,007 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 11:08:25,028 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 11:08:25,031 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 11:08:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 11:08:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:25,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 11:08:25,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-18 11:08:25,079 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 11:08:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:25,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 11:08:25,081 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;@57c55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 11:08:25,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 11:08:26,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:08:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1928881372, now seen corresponding path program 1 times [2024-10-18 11:08:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589280633] [2024-10-18 11:08:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 11:08:26,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:26,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589280633] [2024-10-18 11:08:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589280633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:26,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:08:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990761596] [2024-10-18 11:08:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:26,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:08:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:08:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:08:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:26,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:26,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:26,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:27,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 11:08:27,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:08:27,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash -117332995, now seen corresponding path program 1 times [2024-10-18 11:08:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079393913] [2024-10-18 11:08:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:08:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079393913] [2024-10-18 11:08:27,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079393913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:27,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:27,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 11:08:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692641936] [2024-10-18 11:08:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:27,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 11:08:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:28,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 11:08:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-18 11:08:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:28,252 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:28,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:28,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:28,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 11:08:28,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:08:28,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash 809276065, now seen corresponding path program 1 times [2024-10-18 11:08:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:28,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203682504] [2024-10-18 11:08:28,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:28,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:08:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:28,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 11:08:28,417 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 11:08:28,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 11:08:28,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-18 11:08:28,420 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 11:08:28,420 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 11:08:28,420 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 11:08:28,421 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 11:08:28,440 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 11:08:28,443 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 11:08:28,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 11:08:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:28,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 11:08:28,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-18 11:08:28,494 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 11:08:28,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:28,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 11:08:28,496 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;@57c55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 11:08:28,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 11:08:30,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:30,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 102992514, now seen corresponding path program 1 times [2024-10-18 11:08:30,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:30,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112527031] [2024-10-18 11:08:30,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:08:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112527031] [2024-10-18 11:08:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112527031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:30,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:08:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764670620] [2024-10-18 11:08:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:08:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:08:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:08:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:30,989 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:30,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:30,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:32,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-18 11:08:32,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:32,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 249500598, now seen corresponding path program 1 times [2024-10-18 11:08:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632767878] [2024-10-18 11:08:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-18 11:08:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632767878] [2024-10-18 11:08:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632767878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:33,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:33,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 11:08:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899304700] [2024-10-18 11:08:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:33,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 11:08:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 11:08:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-18 11:08:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:33,611 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:33,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:33,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:33,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:35,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-18 11:08:35,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:35,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1462831870, now seen corresponding path program 1 times [2024-10-18 11:08:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710622515] [2024-10-18 11:08:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:35,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 11:08:35,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710622515] [2024-10-18 11:08:35,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710622515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:35,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:08:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960093810] [2024-10-18 11:08:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:35,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:08:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:08:35,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:08:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:35,847 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:35,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:35,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:35,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:37,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-18 11:08:37,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:37,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -84830510, now seen corresponding path program 2 times [2024-10-18 11:08:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:37,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477871301] [2024-10-18 11:08:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477871301] [2024-10-18 11:08:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477871301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:08:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165016909] [2024-10-18 11:08:37,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 11:08:37,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:08:37,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:37,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:08:37,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 11:08:37,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 11:08:37,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:08:37,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-18 11:08:37,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:08:37,799 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 8 treesize of output 1 [2024-10-18 11:08:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-18 11:08:37,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-18 11:08:37,921 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 11:08:37,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 11:08:37,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-18 11:08:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:37,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:08:38,073 WARN L851 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_2 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-10-18 11:08:38,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-18 11:08:38,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 11:08:38,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-18 11:08:38,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:08:38,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-18 11:08:38,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:08:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165016909] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 11:08:38,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 11:08:38,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-10-18 11:08:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188642978] [2024-10-18 11:08:38,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 11:08:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-18 11:08:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-18 11:08:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=4, NotChecked=46, Total=650 [2024-10-18 11:08:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:38,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:38,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:38,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:38,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:38,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:38,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:39,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (not (= c_~top~0 0)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-18 11:08:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-18 11:08:41,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-18 11:08:42,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-18 11:08:42,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:42,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1511065654, now seen corresponding path program 3 times [2024-10-18 11:08:42,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:42,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119980189] [2024-10-18 11:08:42,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:42,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 11:08:42,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:42,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119980189] [2024-10-18 11:08:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119980189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:08:42,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:08:42,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:08:42,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134991636] [2024-10-18 11:08:42,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:08:42,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:08:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:42,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:08:42,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:08:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:42,318 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:42,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:42,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:42,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:42,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:42,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-18 11:08:42,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:43,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= c_~top~0 0)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-18 11:08:43,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-18 11:08:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-18 11:08:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:45,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-18 11:08:45,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:08:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:08:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash -279706518, now seen corresponding path program 4 times [2024-10-18 11:08:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:08:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755391346] [2024-10-18 11:08:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:08:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:08:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755391346] [2024-10-18 11:08:45,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755391346] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:08:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180315673] [2024-10-18 11:08:45,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 11:08:45,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:08:45,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:08:45,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:08:45,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-18 11:08:45,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 11:08:45,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:08:45,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-18 11:08:45,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:08:45,741 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 8 treesize of output 1 [2024-10-18 11:08:45,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-18 11:08:45,835 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:08:45,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-18 11:08:46,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:08:46,019 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 31 treesize of output 23 [2024-10-18 11:08:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:46,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:08:46,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:08:46,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-18 11:08:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:08:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180315673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 11:08:47,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 11:08:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2024-10-18 11:08:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099306011] [2024-10-18 11:08:47,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 11:08:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-18 11:08:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:08:47,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 384 [2024-10-18 11:08:47,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:08:47,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:08:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash 499914772, now seen corresponding path program 1 times [2024-10-18 11:08:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:47,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:08:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:47,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2024-10-18 11:08:47,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:08:47,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:08:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1682530671, now seen corresponding path program 1 times [2024-10-18 11:08:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:47,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:08:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:47,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-18 11:08:47,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 treesize of output 34 [2024-10-18 11:08:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash -681533233, now seen corresponding path program 1 times [2024-10-18 11:08:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:48,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:08:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:48,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 treesize of output 34 [2024-10-18 11:08:48,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-18 11:08:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 347286658, now seen corresponding path program 1 times [2024-10-18 11:08:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:08:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:08:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:48,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:08:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:08:48,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-18 11:08:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=739, Unknown=7, NotChecked=0, Total=870 [2024-10-18 11:08:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:48,639 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:08:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:08:48,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:48,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:48,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:48,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-10-18 11:08:48,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:08:48,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:08:50,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:08:54,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:09:06,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-18 11:09:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-18 11:09:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-18 11:09:08,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 11:09:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-10-18 11:09:08,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:09:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:09:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1314362010, now seen corresponding path program 5 times [2024-10-18 11:09:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:09:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206502471] [2024-10-18 11:09:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:09:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:09:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:09:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:09:09,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:09:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206502471] [2024-10-18 11:09:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206502471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:09:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326931150] [2024-10-18 11:09:09,030 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-18 11:09:09,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:09:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:09:09,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:09:09,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-18 11:09:09,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-18 11:09:09,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:09:09,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-18 11:09:09,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:09:09,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-18 11:09:09,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-18 11:09:09,285 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 11:09:09,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 11:09:09,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-18 11:09:09,405 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:09:09,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-18 11:09:09,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:09,529 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 31 treesize of output 23 [2024-10-18 11:09:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:09:09,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:09:09,871 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 (+ c_~next_alloc_idx~0 2))) (or (< 62 c_~next_alloc_idx~0) (= .cse0 0) (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10))) (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse0))) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_43 Int)) (or (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_43 v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (or (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-18 11:09:10,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:10,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-18 11:09:10,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:10,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-18 11:09:10,248 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 255 treesize of output 241 [2024-10-18 11:09:10,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-10-18 11:09:10,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-10-18 11:09:10,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:10,286 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 56 treesize of output 58 [2024-10-18 11:09:10,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:10,305 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 409 treesize of output 401 [2024-10-18 11:09:10,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:10,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 312 treesize of output 315 [2024-10-18 11:09:10,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 304 [2024-10-18 11:09:10,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 318 [2024-10-18 11:09:10,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 290 [2024-10-18 11:09:10,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:10,358 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 290 treesize of output 293 [2024-10-18 11:09:10,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2024-10-18 11:09:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:09:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326931150] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 11:09:11,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 11:09:11,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2024-10-18 11:09:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936443621] [2024-10-18 11:09:11,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 11:09:11,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-18 11:09:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:09:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-18 11:09:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=773, Unknown=2, NotChecked=58, Total=992 [2024-10-18 11:09:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:09:11,020 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:09:11,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:09:11,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:11,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:11,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:11,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-10-18 11:09:11,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:11,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-10-18 11:09:11,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:09:16,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-18 11:09:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-18 11:09:43,785 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-18 11:09:43,973 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,SelfDestructingSolverStorable17 [2024-10-18 11:09:43,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:09:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:09:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1658704302, now seen corresponding path program 6 times [2024-10-18 11:09:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:09:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27329168] [2024-10-18 11:09:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:09:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:09:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:09:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:09:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:09:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27329168] [2024-10-18 11:09:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27329168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:09:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661511564] [2024-10-18 11:09:44,241 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-18 11:09:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:09:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:09:44,243 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:09:44,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-18 11:09:44,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-18 11:09:44,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:09:44,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-18 11:09:44,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:09:44,430 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 8 treesize of output 1 [2024-10-18 11:09:44,447 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 8 treesize of output 1 [2024-10-18 11:09:44,576 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:09:44,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-18 11:09:44,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:44,697 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 32 treesize of output 24 [2024-10-18 11:09:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:09:44,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:09:44,844 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-18 11:09:45,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:09:45,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-18 11:09:45,270 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 193 treesize of output 179 [2024-10-18 11:09:45,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-10-18 11:09:45,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-10-18 11:09:45,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2024-10-18 11:09:45,301 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 78 treesize of output 70 [2024-10-18 11:09:45,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-18 11:09:45,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-18 11:09:45,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 11:09:45,331 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 248 treesize of output 236 [2024-10-18 11:09:45,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2024-10-18 11:09:45,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 151 [2024-10-18 11:09:45,404 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 78 treesize of output 70 [2024-10-18 11:09:45,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-18 11:09:45,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-18 11:09:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:09:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661511564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 11:09:45,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 11:09:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-10-18 11:09:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807174090] [2024-10-18 11:09:45,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 11:09:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-18 11:09:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:09:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-18 11:09:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=451, Unknown=1, NotChecked=44, Total=600 [2024-10-18 11:09:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:09:45,719 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:09:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:09:45,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:45,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:09:45,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:45,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-10-18 11:09:45,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:09:45,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-18 11:09:45,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-10-18 11:09:45,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:09:46,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65))) (.cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (and (or (and .cse0 .cse1) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0)) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) (and .cse0 (or (< 64 c_~next_alloc_idx~0) .cse1))))) is different from false [2024-10-18 11:09:47,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65))) (.cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (and (or (and .cse0 .cse1) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) (and .cse0 (or (< 64 c_~next_alloc_idx~0) .cse1))))) is different from false [2024-10-18 11:09:49,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:10:18,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:10:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:10:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-18 11:10:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:10:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-10-18 11:10:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:10:18,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-18 11:10:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:10:18,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:10:18,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:10:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash 872272050, now seen corresponding path program 1 times [2024-10-18 11:10:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:10:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434809873] [2024-10-18 11:10:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:10:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:10:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:10:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:10:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:10:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434809873] [2024-10-18 11:10:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434809873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:10:19,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:10:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-18 11:10:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383702202] [2024-10-18 11:10:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:10:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 11:10:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:10:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 11:10:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-18 11:10:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:10:19,591 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:10:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:10:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:10:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2024-10-18 11:10:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:19,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:10:19,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-10-18 11:10:19,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:10:19,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-10-18 11:10:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:10:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:10:31,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-18 11:10:31,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:10:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:10:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 719833751, now seen corresponding path program 1 times [2024-10-18 11:10:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:10:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474416106] [2024-10-18 11:10:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:10:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:10:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:10:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:10:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:10:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474416106] [2024-10-18 11:10:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474416106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:10:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:10:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-18 11:10:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941010492] [2024-10-18 11:10:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:10:31,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-18 11:10:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:10:31,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-18 11:10:31,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-18 11:10:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:10:31,938 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:10:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:10:31,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:10:31,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:10:47,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:11:05,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:11:06,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (= 3 c_~top~0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-18 11:11:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2024-10-18 11:11:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:08,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-18 11:11:08,856 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:11:08,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:11:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1697218046, now seen corresponding path program 2 times [2024-10-18 11:11:08,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:11:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63667976] [2024-10-18 11:11:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:11:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:11:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:11:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63667976] [2024-10-18 11:11:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63667976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:11:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:11:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-18 11:11:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901109523] [2024-10-18 11:11:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:11:09,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 11:11:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:11:09,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 11:11:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-18 11:11:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:09,654 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:11:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:11:09,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2024-10-18 11:11:09,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:09,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:09,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:09,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2024-10-18 11:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-18 11:11:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-18 11:11:16,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:11:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:11:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -500481077, now seen corresponding path program 2 times [2024-10-18 11:11:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:11:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96407156] [2024-10-18 11:11:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:11:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:11:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:11:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96407156] [2024-10-18 11:11:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96407156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:11:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:11:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-18 11:11:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455833816] [2024-10-18 11:11:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:11:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-18 11:11:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:11:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-18 11:11:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-18 11:11:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:17,778 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:11:17,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:11:17,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2024-10-18 11:11:17,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:17,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:17,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:17,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-18 11:11:17,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-18 11:11:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-18 11:11:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 11:11:25,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-18 11:11:25,172 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:11:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:11:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1135819760, now seen corresponding path program 3 times [2024-10-18 11:11:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:11:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393263123] [2024-10-18 11:11:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:11:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 11:11:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:11:25,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393263123] [2024-10-18 11:11:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393263123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:11:25,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:11:25,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-18 11:11:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188177429] [2024-10-18 11:11:25,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:11:25,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 11:11:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:11:25,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 384 [2024-10-18 11:11:25,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:11:25,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:11:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1304762862, now seen corresponding path program 1 times [2024-10-18 11:11:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:11:25,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:11:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:11:25,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 11:11:25,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-18 11:11:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:25,790 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:11:25,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:11:25,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:25,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:25,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:25,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:25,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-18 11:11:25,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 11:11:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-18 11:11:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2024-10-18 11:11:40,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:11:40,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:11:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash -864437488, now seen corresponding path program 4 times [2024-10-18 11:11:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:11:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096810108] [2024-10-18 11:11:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:11:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 11:11:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:11:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096810108] [2024-10-18 11:11:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096810108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:11:40,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:11:40,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-18 11:11:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735944041] [2024-10-18 11:11:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:11:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 11:11:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:11:40,968 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-18 11:11:40,968 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 35 treesize of output 19 [2024-10-18 11:11:40,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 724 [2024-10-18 11:11:41,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 724 [2024-10-18 11:11:41,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 724 [2024-10-18 11:11:41,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 298 [2024-10-18 11:11:41,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1855509725, now seen corresponding path program 1 times [2024-10-18 11:11:41,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:41,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:11:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:11:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:11:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:11:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:11:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:11:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-18 11:11:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-18 11:11:41,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:11:41,176 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:11:41,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-18 11:11:41,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-18 11:11:41,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-18 11:11:41,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:00,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-18 11:12:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-18 11:12:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-18 11:12:01,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 11:12:01,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2024-10-18 11:12:01,702 INFO L414 BasicCegarLoop]: Path program histogram: [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-18 11:12:01,702 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-10-18 11:12:01,704 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 11:12:01,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 11:12:01,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:12:01,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 11:12:01,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-18 11:12:01,749 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 11:12:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:01,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 11:12:01,750 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;@57c55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 11:12:01,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 11:12:03,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:12:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 191575975, now seen corresponding path program 1 times [2024-10-18 11:12:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938951358] [2024-10-18 11:12:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 11:12:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:03,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938951358] [2024-10-18 11:12:03,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938951358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:03,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:12:03,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:12:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869223713] [2024-10-18 11:12:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:03,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:12:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:12:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:12:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:03,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:03,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:03,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:05,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:05,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-18 11:12:05,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:12:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -748076069, now seen corresponding path program 1 times [2024-10-18 11:12:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26507342] [2024-10-18 11:12:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-18 11:12:05,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:05,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26507342] [2024-10-18 11:12:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26507342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:05,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:12:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 11:12:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622142886] [2024-10-18 11:12:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:05,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 11:12:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 11:12:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-18 11:12:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:06,088 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:06,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:06,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:06,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-18 11:12:06,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 11:12:06,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1651364428, now seen corresponding path program 1 times [2024-10-18 11:12:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270357807] [2024-10-18 11:12:06,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:06,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:06,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 11:12:06,369 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 11:12:06,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 11:12:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-18 11:12:06,372 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 11:12:06,372 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-10-18 11:12:06,372 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 11:12:06,372 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-18 11:12:06,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 11:12:06,578 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 11:12:06,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 11:12:06,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:12:06,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 11:12:06,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-10-18 11:12:06,622 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 11:12:06,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:06,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-10-18 11:12:06,623 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;@57c55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 11:12:06,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 11:12:09,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash 561224366, now seen corresponding path program 1 times [2024-10-18 11:12:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515900834] [2024-10-18 11:12:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:12:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515900834] [2024-10-18 11:12:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515900834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:12:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:12:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584307967] [2024-10-18 11:12:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:09,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:12:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:12:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:12:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:09,999 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:11,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-18 11:12:11,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:11,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1181339223, now seen corresponding path program 1 times [2024-10-18 11:12:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:11,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655857193] [2024-10-18 11:12:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-18 11:12:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655857193] [2024-10-18 11:12:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655857193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:11,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:12:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 11:12:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606002949] [2024-10-18 11:12:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 11:12:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:12,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 11:12:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-18 11:12:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:12,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:12,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:12,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:12,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:16,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:16,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:16,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-18 11:12:16,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 261462702, now seen corresponding path program 1 times [2024-10-18 11:12:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221268119] [2024-10-18 11:12:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 11:12:16,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:16,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221268119] [2024-10-18 11:12:16,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221268119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:16,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:12:16,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:12:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355586749] [2024-10-18 11:12:16,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:16,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:12:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:12:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:12:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:16,461 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:16,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:16,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:16,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:20,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-18 11:12:20,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash 985065518, now seen corresponding path program 1 times [2024-10-18 11:12:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249382075] [2024-10-18 11:12:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-18 11:12:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249382075] [2024-10-18 11:12:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249382075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:20,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 11:12:20,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 11:12:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286013342] [2024-10-18 11:12:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:20,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 11:12:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:20,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 11:12:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 11:12:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:20,169 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:20,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:20,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:20,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:20,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:20,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-18 11:12:23,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash 102748947, now seen corresponding path program 1 times [2024-10-18 11:12:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939306501] [2024-10-18 11:12:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939306501] [2024-10-18 11:12:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939306501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:12:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089328559] [2024-10-18 11:12:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:12:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:12:23,683 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:12:23,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-18 11:12:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:23,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-18 11:12:23,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:12:23,864 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 8 treesize of output 1 [2024-10-18 11:12:23,888 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 8 treesize of output 1 [2024-10-18 11:12:23,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-18 11:12:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-18 11:12:23,987 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 11:12:23,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 11:12:24,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-18 11:12:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:24,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:12:24,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-18 11:12:24,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-18 11:12:24,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:12:24,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-18 11:12:24,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:12:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089328559] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 11:12:24,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 11:12:24,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2024-10-18 11:12:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834033066] [2024-10-18 11:12:24,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 11:12:24,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-18 11:12:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-18 11:12:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=687, Unknown=13, NotChecked=0, Total=812 [2024-10-18 11:12:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:24,971 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:24,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:41,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-18 11:12:41,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:12:41,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1359227292, now seen corresponding path program 2 times [2024-10-18 11:12:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226862551] [2024-10-18 11:12:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226862551] [2024-10-18 11:12:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226862551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:12:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841613524] [2024-10-18 11:12:41,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 11:12:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:12:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:12:41,889 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:12:41,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-18 11:12:42,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-18 11:12:42,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:12:42,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-18 11:12:42,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:12:42,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2024-10-18 11:12:42,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-18 11:12:42,078 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 8 treesize of output 1 [2024-10-18 11:12:42,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 11:12:42,172 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-18 11:12:42,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 88 [2024-10-18 11:12:42,217 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-18 11:12:42,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2024-10-18 11:12:42,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 11:12:42,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:12:42,243 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 15 treesize of output 19 [2024-10-18 11:12:42,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 11:12:42,650 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 23 treesize of output 11 [2024-10-18 11:12:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-18 11:12:42,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 11:12:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841613524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:42,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 11:12:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2024-10-18 11:12:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058120866] [2024-10-18 11:12:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 11:12:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:42,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 17 [2024-10-18 11:12:42,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2024-10-18 11:12:42,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:12:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash 681705114, now seen corresponding path program 1 times [2024-10-18 11:12:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:42,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:42,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 384 [2024-10-18 11:12:42,983 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:12:42,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:12:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash -342018752, now seen corresponding path program 1 times [2024-10-18 11:12:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:43,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:43,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 11:12:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-18 11:12:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:43,444 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:47,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 11:12:49,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 11:12:51,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 11:12:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 11:12:52,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-18 11:12:52,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2024-10-18 11:12:52,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash -151749954, now seen corresponding path program 3 times [2024-10-18 11:12:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714379] [2024-10-18 11:12:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714379] [2024-10-18 11:12:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:12:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824563208] [2024-10-18 11:12:53,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 11:12:53,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:12:53,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:12:53,093 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:12:53,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-18 11:12:53,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-18 11:12:53,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:12:53,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-18 11:12:53,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:12:53,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2024-10-18 11:12:53,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-18 11:12:53,280 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 8 treesize of output 1 [2024-10-18 11:12:53,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 11:12:53,345 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-18 11:12:53,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 88 [2024-10-18 11:12:53,402 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-18 11:12:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2024-10-18 11:12:53,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 11:12:53,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:12:53,423 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 15 treesize of output 19 [2024-10-18 11:12:53,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 11:12:53,709 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 23 treesize of output 11 [2024-10-18 11:12:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-18 11:12:53,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 11:12:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824563208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 11:12:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 11:12:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-10-18 11:12:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240003364] [2024-10-18 11:12:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 11:12:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:53,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 234 [2024-10-18 11:12:53,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:12:53,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:12:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash 681705222, now seen corresponding path program 1 times [2024-10-18 11:12:53,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:53,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:54,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2024-10-18 11:12:54,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:12:54,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:12:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash -342018644, now seen corresponding path program 1 times [2024-10-18 11:12:54,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:54,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:54,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 11:12:54,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-10-18 11:12:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:54,382 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:54,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 11:12:54,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:57,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 11:12:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 11:12:57,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-18 11:12:57,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable39 [2024-10-18 11:12:57,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:12:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:12:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2020644764, now seen corresponding path program 4 times [2024-10-18 11:12:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:12:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113211187] [2024-10-18 11:12:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:12:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:58,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:12:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113211187] [2024-10-18 11:12:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113211187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:12:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936610577] [2024-10-18 11:12:58,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 11:12:58,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:12:58,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:12:58,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:12:58,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-18 11:12:58,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 11:12:58,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:12:58,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-18 11:12:58,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:12:58,301 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 8 treesize of output 1 [2024-10-18 11:12:58,322 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 8 treesize of output 1 [2024-10-18 11:12:58,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-18 11:12:58,443 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:12:58,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-18 11:12:58,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:12:58,565 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 31 treesize of output 23 [2024-10-18 11:12:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 11:12:58,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:12:58,661 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_23 (Array Int Int)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= 0 (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_23) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (= (select v_DerPreprocessor_23 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-10-18 11:12:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 11:12:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936610577] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-18 11:12:58,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-18 11:12:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 12] total 31 [2024-10-18 11:12:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292412039] [2024-10-18 11:12:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 11:12:58,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-18 11:12:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:12:59,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 17 [2024-10-18 11:12:59,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 384 [2024-10-18 11:12:59,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:12:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 681705330, now seen corresponding path program 1 times [2024-10-18 11:12:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:59,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:59,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 234 [2024-10-18 11:12:59,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:12:59,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2024-10-18 11:12:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -342018536, now seen corresponding path program 1 times [2024-10-18 11:12:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:12:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:12:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:59,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 11:12:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 11:12:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-18 11:12:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=701, Unknown=1, NotChecked=56, Total=930 [2024-10-18 11:12:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:12:59,730 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:12:59,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 11:12:59,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:13:03,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:04,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse2 (forall ((v_DerPreprocessor_23 (Array Int Int)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= 0 (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_23) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (= (select v_DerPreprocessor_23 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0))))) (let ((.cse0 (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0))))) (.cse3 (or .cse1 .cse2))) (and .cse0 (or .cse1 .cse2 (= (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) .cse3 (or (= |c_thr1Thread4of4ForFork0_push_#t~mem1#1| 0) (and .cse0 .cse3))))) is different from false [2024-10-18 11:13:09,135 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 [1] [2024-10-18 11:13:11,957 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 [1] [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 11:13:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 11:13:13,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-18 11:13:13,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:13:13,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 11:13:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 11:13:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash 458395100, now seen corresponding path program 5 times [2024-10-18 11:13:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 11:13:13,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792198405] [2024-10-18 11:13:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 11:13:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 11:13:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 11:13:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:13:14,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 11:13:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792198405] [2024-10-18 11:13:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792198405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 11:13:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230713164] [2024-10-18 11:13:14,182 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-18 11:13:14,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 11:13:14,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 11:13:14,184 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 11:13:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-18 11:13:14,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-18 11:13:14,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 11:13:14,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-18 11:13:14,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 11:13:14,391 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 8 treesize of output 1 [2024-10-18 11:13:14,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-18 11:13:14,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-18 11:13:14,507 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 11:13:14,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-18 11:13:14,542 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 11:13:14,543 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 27 treesize of output 27 [2024-10-18 11:13:14,609 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-10-18 11:13:14,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 50 [2024-10-18 11:13:14,703 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-18 11:13:14,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2024-10-18 11:13:14,812 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-10-18 11:13:14,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2024-10-18 11:13:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:13:14,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 11:13:14,989 WARN L851 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-10-18 11:13:15,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2024-10-18 11:13:15,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2024-10-18 11:13:15,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 11:13:19,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:19,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-18 11:13:19,414 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:13:19,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 301 treesize of output 301 [2024-10-18 11:13:19,591 INFO L349 Elim1Store]: treesize reduction 274, result has 32.0 percent of original size [2024-10-18 11:13:19,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 315 treesize of output 419 [2024-10-18 11:13:19,832 INFO L349 Elim1Store]: treesize reduction 198, result has 38.5 percent of original size [2024-10-18 11:13:19,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 690 treesize of output 789 [2024-10-18 11:13:19,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:19,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 316 treesize of output 464 [2024-10-18 11:13:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 211 [2024-10-18 11:13:20,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 209 [2024-10-18 11:13:20,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 207 [2024-10-18 11:13:20,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 205 [2024-10-18 11:13:20,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 203 [2024-10-18 11:13:20,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 201 [2024-10-18 11:13:20,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 199 [2024-10-18 11:13:20,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 197 [2024-10-18 11:13:20,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 195 [2024-10-18 11:13:20,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 193 [2024-10-18 11:13:24,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:24,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-18 11:13:24,653 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:24,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:24,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-18 11:13:24,750 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:24,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:24,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-18 11:13:24,843 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:24,853 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:24,970 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:24,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:13:24,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,017 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:13:25,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:13:25,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,053 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:25,106 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:13:25,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2024-10-18 11:13:25,161 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:13:25,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2024-10-18 11:13:25,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,279 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:13:25,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2024-10-18 11:13:25,291 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:25,295 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:25,348 INFO L349 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2024-10-18 11:13:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 180 treesize of output 248 [2024-10-18 11:13:25,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,770 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-18 11:13:25,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2024-10-18 11:13:25,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-18 11:13:25,822 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-10-18 11:13:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 122 [2024-10-18 11:13:26,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:26,155 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 22 treesize of output 26 [2024-10-18 11:13:26,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2024-10-18 11:13:26,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 11:13:26,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2024-10-18 11:13:26,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-18 11:13:26,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-18 11:13:26,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-18 11:13:26,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-18 11:13:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-18 11:13:26,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-18 11:13:26,417 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 11:13:26,417 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 64 treesize of output 1 [2024-10-18 11:13:26,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:13:26,426 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:26,428 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 11:13:26,429 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-18 11:13:26,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-18 11:13:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 11:13:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230713164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 11:13:26,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 11:13:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 33 [2024-10-18 11:13:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166012262] [2024-10-18 11:13:26,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 11:13:26,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-18 11:13:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 11:13:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-18 11:13:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=913, Unknown=21, NotChecked=62, Total=1122 [2024-10-18 11:13:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:13:26,948 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 11:13:26,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 33 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 11:13:26,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 11:13:27,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse5 (+ c_~next_alloc_idx~0 3)) (.cse4 (< c_~next_alloc_idx~0 65)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse6 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse4) (not (= .cse5 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse6) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (<= 0 .cse5) (or .cse4 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (not (= c_~top~0 0)) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse10 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse10) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse6) (not (= (+ (select .cse10 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse6) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse6) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0))) is different from false [2024-10-18 11:13:27,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse4 (+ c_~next_alloc_idx~0 3)) (.cse3 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or .cse1 .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse3) (not (= .cse4 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 (+ c_~next_alloc_idx~0 2)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse6 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (<= 0 .cse4) (or .cse3 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))) is different from false [2024-10-18 11:13:28,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:29,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse6 (+ c_~next_alloc_idx~0 3)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) (<= 5 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (and (or .cse1 .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5) (not (= .cse6 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (<= 0 .cse6) (or .cse5 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (not (= c_~top~0 0)) (or (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0)))))) .cse0) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse7) (not (= (+ (select .cse11 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse12 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse7) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse12) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse12 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse14 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse14 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse14 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0) (or (= (select .cse2 0) 3) (= |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_47| Int)) (= (select (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_47|) 0) 3))))) is different from false [2024-10-18 11:13:35,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:37,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:39,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:49,534 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 [1] [2024-10-18 11:13:51,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:53,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:55,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:57,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:13:59,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:09,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:09,936 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse4 (+ c_~next_alloc_idx~0 3)) (.cse3 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or .cse1 .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse3) (not (= .cse4 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 (+ c_~next_alloc_idx~0 2)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse6 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (<= 0 .cse4) (or .cse3 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (not (= c_~top~0 0)))) is different from false [2024-10-18 11:14:12,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:14,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:16,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:18,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:20,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:27,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:29,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:31,753 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 [1] [2024-10-18 11:14:33,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:35,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:38,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 [1] [2024-10-18 11:14:40,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:42,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:44,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:44,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse6 (+ c_~next_alloc_idx~0 3)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) (or .cse0 (and (or .cse1 .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5) (not (= .cse6 0)) (not (= (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (<= 0 .cse6) (or .cse5 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (not (= c_~top~0 0)) (or (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0)))))) .cse0) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse7) (not (= (+ (select .cse11 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse12 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse7) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse12) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse12 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse14 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse14 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse14 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0))) is different from false [2024-10-18 11:14:49,498 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse6 (+ c_~next_alloc_idx~0 3)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) (or .cse0 (and (or .cse1 .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5) (not (= .cse6 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (<= 0 .cse6) (or .cse5 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (not (= c_~top~0 0)) (< 0 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (or (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0)))))) .cse0) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse7) (not (= (+ (select .cse11 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse12 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse7) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse12) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse12 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse14 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse14 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse14 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0))) is different from false [2024-10-18 11:14:52,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:57,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:14:58,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:00,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:12,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:14,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:16,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:18,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 [1] [2024-10-18 11:15:20,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:22,052 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 [1] [2024-10-18 11:15:24,062 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 [1] [2024-10-18 11:15:26,070 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 [1] [2024-10-18 11:15:40,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:42,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:44,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:46,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:48,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:50,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:15:52,412 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 [1] [2024-10-18 11:16:04,635 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 [1] [2024-10-18 11:16:06,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:08,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:09,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse5 (+ c_~next_alloc_idx~0 3)) (.cse4 (< c_~next_alloc_idx~0 65)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse6 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse4) (not (= .cse5 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse6) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (<= 0 .cse5) (or .cse4 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse10 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse10) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse6) (not (= (+ (select .cse10 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse6) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse6) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0))) is different from false [2024-10-18 11:16:09,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse6 (+ c_~next_alloc_idx~0 3)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) (<= 5 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (and (or .cse1 .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5) (not (= .cse6 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (<= 0 .cse6) (or .cse5 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0)))))) .cse0) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse7) (not (= (+ (select .cse11 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse12 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse7) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse12) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse12 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse14 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse14 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse14 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0) (or (= (select .cse2 0) 3) (= |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_47| Int)) (= (select (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_47|) 0) 3))))) is different from false [2024-10-18 11:16:29,483 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 [1] [2024-10-18 11:16:31,491 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 [1] [2024-10-18 11:16:33,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:48,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:50,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:52,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:54,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:16:56,923 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 [1] [2024-10-18 11:16:59,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse6 (+ c_~next_alloc_idx~0 3)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) (or .cse0 (and (or .cse1 .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5) (not (= .cse6 0)) (not (= (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (<= 0 .cse6) (or .cse5 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0)))))) .cse0) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse7) (not (= (+ (select .cse11 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse12 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse7) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse12) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse12 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse14 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse14 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse14 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0))) is different from false [2024-10-18 11:17:06,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse6 (+ c_~next_alloc_idx~0 3)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) (or .cse0 (and (or .cse1 .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2132) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse4 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5) (not (= .cse6 0)) (<= c_~next_alloc_idx~0 60) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse8 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse5 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (<= 0 .cse6) (or .cse5 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (or (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0)))))) .cse0) (or (and (or .cse3 (and (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 .cse7) (not (= (+ (select .cse11 0) 1) 0))))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse12 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 .cse7) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse12) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse12 0) 1) 0))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 .cse7) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse13 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse13 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse14 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse14 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store .cse14 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))))) .cse1)) .cse0))) is different from false [2024-10-18 11:17:09,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:17:11,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:17:11,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse4 (< c_~next_alloc_idx~0 65)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (or .cse1 .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse4) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 (+ c_~next_alloc_idx~0 2)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse6 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse4 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse4 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (let ((.cse8 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse8 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))) (or .cse3 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse8 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0))))))) .cse0))) is different from false [2024-10-18 11:17:11,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse3 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or .cse1 .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2135 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2135 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) (< v_ArrVal_2135 c_~next_alloc_idx~0))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 c_~next_alloc_idx~0)))))))) (or (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)))) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse3) (or .cse0 (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int)) (or (< v_ArrVal_2135 (+ c_~next_alloc_idx~0 2)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2135 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2135)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2135 1))) (not (= (+ c_~next_alloc_idx~0 1) 0))))) (or .cse3 (and (forall ((v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_173 Int) (v_prenex_170 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_170 v_prenex_172) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_171) v_prenex_170) v_prenex_173))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_28))) (or (not (= (+ (select (select .cse6 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30|) 0) 1) 0)) (< 0 (select (select (store (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_27) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| v_DerPreprocessor_26) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_30| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))) is different from false [2024-10-18 11:17:13,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:17:34,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:17:36,174 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 [1] [2024-10-18 11:17:38,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:17:58,677 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 [1] [2024-10-18 11:18:00,683 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 [1] [2024-10-18 11:18:02,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:18:04,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:18:27,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:18:29,532 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 [1] [2024-10-18 11:18:31,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:18:33,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:18:35,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:18:38,245 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 [1] [2024-10-18 11:18:58,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:11,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:13,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:15,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:33,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:36,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:38,991 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 [1] [2024-10-18 11:19:40,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:42,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:45,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:47,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:49,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:51,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:53,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:55,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:57,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:19:59,221 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 [1] [2024-10-18 11:20:01,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:03,232 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 [1] [2024-10-18 11:20:04,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:06,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:08,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:10,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:12,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:14,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:16,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:18,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:20,607 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 [1] [2024-10-18 11:20:23,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:25,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:27,185 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 [1] [2024-10-18 11:20:29,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:30,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:32,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:34,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:36,353 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 [1] [2024-10-18 11:20:38,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:41,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:43,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:45,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:48,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:50,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:52,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:54,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:56,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:20:58,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:00,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:02,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:04,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:06,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:07,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:10,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:12,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:14,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:16,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:18,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:20,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:22,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:25,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:27,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:29,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:31,269 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 [1] [2024-10-18 11:21:33,288 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 [1] [2024-10-18 11:21:35,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:37,304 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 [1] [2024-10-18 11:21:40,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:42,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:44,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:46,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 11:21:48,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15