./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 22:09:05,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 22:09:06,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 22:09:06,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 22:09:06,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 22:09:06,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 22:09:06,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 22:09:06,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 22:09:06,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 22:09:06,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 22:09:06,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 22:09:06,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 22:09:06,099 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 22:09:06,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 22:09:06,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 22:09:06,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 22:09:06,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 22:09:06,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 22:09:06,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 22:09:06,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 22:09:06,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 22:09:06,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 22:09:06,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 22:09:06,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 22:09:06,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 22:09:06,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 22:09:06,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 22:09:06,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 22:09:06,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 22:09:06,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 22:09:06,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 22:09:06,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 22:09:06,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 22:09:06,108 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 22:09:06,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 22:09:06,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 22:09:06,109 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 22:09:06,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 22:09:06,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 22:09:06,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 22:09:06,111 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 22:09:06,111 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 213 [2024-10-17 22:09:06,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 22:09:06,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 22:09:06,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 22:09:06,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 22:09:06,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 22:09:06,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-17 22:09:07,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 22:09:08,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 22:09:08,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-17 22:09:08,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c8fbed4df/b07755f4313a4d0096d087561b08b0a2/FLAG76376f8a9 [2024-10-17 22:09:08,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c8fbed4df/b07755f4313a4d0096d087561b08b0a2 [2024-10-17 22:09:08,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 22:09:08,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 22:09:08,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 22:09:08,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 22:09:08,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 22:09:08,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:08,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107f78ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08, skipping insertion in model container [2024-10-17 22:09:08,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:08,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 22:09:08,791 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-10-17 22:09:08,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 22:09:08,853 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 22:09:08,894 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-10-17 22:09:08,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 22:09:08,969 INFO L204 MainTranslator]: Completed translation [2024-10-17 22:09:08,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08 WrapperNode [2024-10-17 22:09:08,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 22:09:08,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 22:09:08,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 22:09:08,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 22:09:08,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,036 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-10-17 22:09:09,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 22:09:09,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 22:09:09,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 22:09:09,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 22:09:09,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 22:09:09,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 22:09:09,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 22:09:09,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 22:09:09,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (1/1) ... [2024-10-17 22:09:09,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 22:09:09,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:09,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 22:09:09,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 22:09:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 22:09:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 22:09:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 22:09:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 22:09:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 22:09:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 22:09:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 22:09:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 22:09:09,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 22:09:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 22:09:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 22:09:09,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 22:09:09,177 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 22:09:09,348 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 22:09:09,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 22:09:09,754 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 22:09:09,754 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 22:09:09,999 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 22:09:10,002 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-17 22:09:10,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:09:10 BoogieIcfgContainer [2024-10-17 22:09:10,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 22:09:10,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 22:09:10,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 22:09:10,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 22:09:10,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:09:08" (1/3) ... [2024-10-17 22:09:10,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e981589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:09:10, skipping insertion in model container [2024-10-17 22:09:10,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:09:08" (2/3) ... [2024-10-17 22:09:10,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e981589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:09:10, skipping insertion in model container [2024-10-17 22:09:10,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:09:10" (3/3) ... [2024-10-17 22:09:10,014 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-17 22:09:10,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 22:09:10,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-17 22:09:10,031 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 22:09:10,082 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 22:09:10,126 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 22:09:10,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 22:09:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:10,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 22:09:10,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 22:09:10,231 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 22:09:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:10,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 22:09:10,259 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;@1597ad71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 22:09:10,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 22:09:10,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-10-17 22:09:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130763911] [2024-10-17 22:09:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:11,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130763911] [2024-10-17 22:09:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130763911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 22:09:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 22:09:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 22:09:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850234996] [2024-10-17 22:09:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 22:09:11,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 22:09:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:09:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 22:09:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 22:09:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:11,130 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:09:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:09:11,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 22:09:11,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-10-17 22:09:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841643344] [2024-10-17 22:09:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:11,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841643344] [2024-10-17 22:09:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841643344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:09:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884764525] [2024-10-17 22:09:11,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:11,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:11,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:09:11,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 22:09:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:11,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 22:09:11,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:09:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:11,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:09:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884764525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:09:11,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:09:11,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 22:09:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702515460] [2024-10-17 22:09:11,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:09:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 22:09:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:09:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 22:09:11,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 22:09:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:11,567 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:09:11,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:09:11,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:11,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:11,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 22:09:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-17 22:09:11,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-10-17 22:09:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859575946] [2024-10-17 22:09:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:12,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:12,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859575946] [2024-10-17 22:09:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859575946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:09:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22771264] [2024-10-17 22:09:12,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 22:09:12,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:12,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:12,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:09:12,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 22:09:12,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 22:09:12,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 22:09:12,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 22:09:12,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:09:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:12,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:09:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 22:09:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22771264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:09:12,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:09:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 22:09:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982413742] [2024-10-17 22:09:12,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:09:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 22:09:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:09:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 22:09:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 22:09:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:12,229 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:09:12,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:09:12,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:12,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:12,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:12,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-17 22:09:12,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:12,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-10-17 22:09:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348139481] [2024-10-17 22:09:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:09:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348139481] [2024-10-17 22:09:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348139481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:09:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077054283] [2024-10-17 22:09:12,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 22:09:12,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:12,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:12,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:09:12,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 22:09:13,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 22:09:13,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 22:09:13,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 22:09:13,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:09:13,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 22:09:13,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 22:09:13,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 22:09:13,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:09:13,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:09:13,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-10-17 22:09:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:09:13,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:09:19,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 22:09:21,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 22:09:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-17 22:09:21,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077054283] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:09:21,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:09:21,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 22:09:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978212987] [2024-10-17 22:09:21,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:09:21,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 22:09:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:09:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 22:09:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-17 22:09:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:21,572 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:09:21,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:09:21,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:21,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:21,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:21,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:21,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 22:09:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:21,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:21,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-10-17 22:09:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:21,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650595592] [2024-10-17 22:09:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:21,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:09:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650595592] [2024-10-17 22:09:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650595592] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:09:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267186666] [2024-10-17 22:09:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:22,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:09:22,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 22:09:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:22,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 22:09:22,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:09:22,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 22:09:22,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 22:09:22,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 22:09:22,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:09:23,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:09:23,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-10-17 22:09:23,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-10-17 22:09:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-17 22:09:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:09:23,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:09:43,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-17 22:09:49,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 22:09:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-17 22:09:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267186666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:09:49,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:09:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-17 22:09:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394003539] [2024-10-17 22:09:49,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:09:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-17 22:09:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:09:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-17 22:09:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=323, Unknown=7, NotChecked=78, Total=506 [2024-10-17 22:09:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:49,633 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:09:49,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:09:49,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:49,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:49,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:49,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:49,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:09:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:09:52,154 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-17 22:09:52,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:52,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -912837368, now seen corresponding path program 1 times [2024-10-17 22:09:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686177036] [2024-10-17 22:09:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-17 22:09:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686177036] [2024-10-17 22:09:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686177036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:09:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249167265] [2024-10-17 22:09:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:52,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:52,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:52,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:09:52,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 22:09:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:52,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 22:09:52,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:09:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-17 22:09:52,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:09:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-17 22:09:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249167265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:09:52,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:09:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-17 22:09:52,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626223793] [2024-10-17 22:09:52,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:09:52,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 22:09:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:09:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 22:09:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 22:09:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:52,687 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:09:52,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:09:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:52,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:52,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:09:52,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:09:52,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:09:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:09:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:09:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:09:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:09:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:09:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 22:09:52,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 22:09:53,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:53,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:09:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:09:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-10-17 22:09:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:09:53,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895303940] [2024-10-17 22:09:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:09:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:09:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:09:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:09:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:09:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895303940] [2024-10-17 22:09:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895303940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:09:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830631802] [2024-10-17 22:09:53,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 22:09:53,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:09:53,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:09:53,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:09:53,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 22:09:53,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 22:09:53,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 22:09:53,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-17 22:09:53,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:09:53,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 22:09:54,169 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-17 22:09:54,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-17 22:09:54,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:09:54,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 22:09:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 22:09:54,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-17 22:09:57,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-17 22:09:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:09:57,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:10:09,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:10:10,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:10:12,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:10:14,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:10:16,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-17 22:10:18,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_510 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_506) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-17 22:10:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-17 22:10:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830631802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:10:18,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:10:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-17 22:10:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635798283] [2024-10-17 22:10:18,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:10:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-17 22:10:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:10:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-17 22:10:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=364, Unknown=15, NotChecked=270, Total=756 [2024-10-17 22:10:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:10:18,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:10:18,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:10:18,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:10:18,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:10:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:10:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:10:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:10:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 22:10:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:10:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:10:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:10:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:10:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:10:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:10:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 22:10:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 22:10:26,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 22:10:26,274 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,SelfDestructingSolverStorable6 [2024-10-17 22:10:26,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:10:26,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:10:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-10-17 22:10:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:10:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377199633] [2024-10-17 22:10:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:10:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:10:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:10:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:10:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:10:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377199633] [2024-10-17 22:10:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377199633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:10:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818289889] [2024-10-17 22:10:27,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 22:10:27,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:10:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:10:27,903 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:10:27,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 22:10:28,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 22:10:28,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 22:10:28,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-17 22:10:28,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:10:28,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 22:10:28,334 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-17 22:10:28,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-17 22:10:28,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:10:28,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 22:10:28,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 22:10:31,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-17 22:10:35,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-17 22:10:41,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-10-17 22:11:01,296 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 76 treesize of output 62 [2024-10-17 22:11:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:11:01,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:11:25,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:11:27,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-17 22:11:29,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:11:31,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:11:33,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2024-10-17 22:11:33,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 22:11:35,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse0)) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|))))) is different from false [2024-10-17 22:11:37,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_640 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ |c_~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse1))))) is different from false [2024-10-17 22:11:40,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_640 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-17 22:11:42,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_640 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-17 22:11:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-17 22:11:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818289889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:11:42,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:11:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-17 22:11:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993458000] [2024-10-17 22:11:42,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:11:42,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-17 22:11:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:11:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-17 22:11:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=692, Unknown=39, NotChecked=650, Total=1560 [2024-10-17 22:11:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:11:42,468 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:11:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:11:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 22:11:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:11:43,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:11:45,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:11:50,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:11:52,411 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 [0] [2024-10-17 22:11:56,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:11:58,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:11:59,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:01,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:17,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:18,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:19,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:21,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:39,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 22:12:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 22:12:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 22:12:41,997 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-17 22:12:42,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:12:42,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 22:12:42,264 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 22:12:42,265 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 1212 treesize of output 1072 [2024-10-17 22:12:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1877605456, now seen corresponding path program 1 times [2024-10-17 22:12:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:12:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:12:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 22:12:42,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 22:12:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 22:12:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 22:12:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-10-17 22:12:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 22:12:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790571751] [2024-10-17 22:12:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 22:12:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 22:12:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 22:13:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:13:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 22:13:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790571751] [2024-10-17 22:13:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790571751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 22:13:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527902549] [2024-10-17 22:13:04,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 22:13:04,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 22:13:04,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 22:13:04,636 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 22:13:04,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-17 22:13:04,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 22:13:04,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 22:13:04,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-17 22:13:04,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 22:13:04,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 22:13:05,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 22:13:05,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 22:13:05,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 22:13:05,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 22:13:05,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 22:13:09,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-17 22:13:12,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-17 22:13:32,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2024-10-17 22:13:41,335 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 238 treesize of output 197 [2024-10-17 22:14:17,198 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 265 treesize of output 224 [2024-10-17 22:14:21,794 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 521 treesize of output 444 [2024-10-17 22:14:25,555 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 618 treesize of output 539 [2024-10-17 22:15:14,851 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 1123 treesize of output 975 [2024-10-17 22:15:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 22:15:15,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 22:15:42,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:15:44,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:15:44,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0))) is different from false [2024-10-17 22:15:47,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 22:15:49,141 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse2 28 |c_~#cache~0.offset|))))) is different from false [2024-10-17 22:15:51,168 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ |c_~#cache~0.offset| .cse0))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0)))))) is different from false [2024-10-17 22:15:53,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| .cse0))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0)))) is different from false [2024-10-17 22:15:55,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_921 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ |c_~#cache~0.offset| .cse3))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse3))))) is different from false [2024-10-17 22:15:57,650 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ |c_~#cache~0.offset| .cse0))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0)))) is different from false [2024-10-17 22:15:59,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse2 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0))))) is different from false [2024-10-17 22:16:01,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse4))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse2 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse4)))))) is different from false [2024-10-17 22:16:04,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse2 (+ |c_~#cache~0.offset| .cse3))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_918 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse3)))))) is different from false [2024-10-17 22:16:06,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_918 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse2 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0))))) is different from false [2024-10-17 22:16:08,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_918 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse2 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0))))) is different from false [2024-10-17 22:16:10,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse1)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse2 |c_~#cache~0.base| (let ((.cse3 (select .cse2 |c_~#cache~0.base|))) (store (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_918 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse3 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0))))) is different from false [2024-10-17 22:16:12,761 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_916 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset| .cse1)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_916 (- 1)))))) (store .cse2 |c_~#cache~0.base| (let ((.cse3 (select .cse2 |c_~#cache~0.base|))) (store (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_918 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse3 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0))))) is different from false [2024-10-17 22:16:15,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_916 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|~#cache~0.offset| Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| 84)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |~#cache~0.offset| 28 .cse1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ v_ArrVal_916 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_918 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse2 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)))))) is different from false [2024-10-17 22:16:17,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (v_ArrVal_918 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|~#cache~0.offset| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse1 (+ |~#cache~0.offset| .cse2))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914) |c_~#cache~0.base|))) (store (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ v_ArrVal_916 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_918 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_926) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| 84)) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |~#cache~0.offset| 28 .cse2)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28)))))) is different from false [2024-10-17 22:16:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-17 22:16:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527902549] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 22:16:18,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 22:16:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 62 [2024-10-17 22:16:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089598918] [2024-10-17 22:16:18,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 22:16:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-17 22:16:18,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 22:16:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-17 22:16:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1599, Unknown=74, NotChecked=1854, Total=3906 [2024-10-17 22:16:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:16:18,399 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 22:16:18,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.492063492063492) internal successors, (283), 62 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 22:16:18,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 22:16:21,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:23,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:25,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:27,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:29,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 [0] [2024-10-17 22:16:42,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:44,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:46,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 [0] [2024-10-17 22:16:48,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:50,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:52,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:16:54,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:14,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:16,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:18,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:20,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:22,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:24,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:26,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:34,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:36,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:38,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:40,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:42,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:17:44,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 [0] [2024-10-17 22:17:46,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:03,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:05,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:08,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:10,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:32,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:34,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:36,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:38,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:40,645 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 [0] [2024-10-17 22:18:42,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:18:44,710 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 [0] [2024-10-17 22:19:17,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:19,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:21,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:23,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:25,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:27,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:29,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:31,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:33,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:35,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:37,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:39,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:41,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:43,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:45,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:47,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:49,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:51,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:53,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:55,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:57,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:19:59,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:01,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:03,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:05,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:07,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:09,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:11,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:13,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:15,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:17,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:19,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:36,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:48,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:50,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:52,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:55,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:56,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:20:59,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:01,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:04,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:06,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:08,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:10,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:12,327 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 [0] [2024-10-17 22:21:14,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:15,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:17,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:19,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:21,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:34,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:35,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:37,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:40,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:42,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:44,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:46,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:48,678 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 [0] [2024-10-17 22:21:50,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:52,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:21:54,953 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 [0] [2024-10-17 22:21:56,971 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 [0] [2024-10-17 22:21:58,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:22:01,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:22:03,450 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 [0] [2024-10-17 22:22:05,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:22:07,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:22:09,486 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 [0] [2024-10-17 22:22:11,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:22:13,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 22:22:15,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 [0] [2024-10-17 22:22:17,945 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] Killed by 15