./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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 21:55:21,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 21:55:21,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 21:55:21,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 21:55:21,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 21:55:21,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 21:55:21,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 21:55:21,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 21:55:21,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 21:55:21,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 21:55:21,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 21:55:21,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 21:55:21,218 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 21:55:21,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 21:55:21,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 21:55:21,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 21:55:21,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 21:55:21,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 21:55:21,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 21:55:21,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 21:55:21,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 21:55:21,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 21:55:21,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 21:55:21,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 21:55:21,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 21:55:21,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 21:55:21,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 21:55:21,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 21:55:21,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 21:55:21,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 21:55:21,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:55:21,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 21:55:21,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 21:55:21,226 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 21:55:21,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 21:55:21,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 21:55:21,227 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 21:55:21,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 21:55:21,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 21:55:21,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 21:55:21,231 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 21:55:21,232 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-18 21:55:21,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 21:55:21,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 21:55:21,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 21:55:21,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 21:55:21,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 21:55:21,526 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-18 21:55:23,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 21:55:23,302 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 21:55:23,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-18 21:55:23,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/39c83f663/8195872cf61c4ae1acdd65063949b988/FLAGd4da700ad [2024-10-18 21:55:23,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/39c83f663/8195872cf61c4ae1acdd65063949b988 [2024-10-18 21:55:23,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 21:55:23,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 21:55:23,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 21:55:23,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 21:55:23,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 21:55:23,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:23,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f301be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23, skipping insertion in model container [2024-10-18 21:55:23,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:23,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 21:55:23,786 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-18 21:55:23,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:55:23,835 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 21:55:23,871 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-18 21:55:23,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:55:23,945 INFO L204 MainTranslator]: Completed translation [2024-10-18 21:55:23,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23 WrapperNode [2024-10-18 21:55:23,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 21:55:23,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 21:55:23,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 21:55:23,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 21:55:23,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:23,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,002 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-10-18 21:55:24,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 21:55:24,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 21:55:24,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 21:55:24,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 21:55:24,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 21:55:24,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 21:55:24,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 21:55:24,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 21:55:24,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (1/1) ... [2024-10-18 21:55:24,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:55:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:24,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 21:55:24,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 21:55:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 21:55:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 21:55:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-18 21:55:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 21:55:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 21:55:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-18 21:55:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 21:55:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-18 21:55:24,141 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-18 21:55:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 21:55:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 21:55:24,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 21:55:24,146 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 21:55:24,308 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 21:55:24,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 21:55:24,726 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 21:55:24,727 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 21:55:24,903 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 21:55:24,903 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-18 21:55:24,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:55:24 BoogieIcfgContainer [2024-10-18 21:55:24,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 21:55:24,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 21:55:24,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 21:55:24,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 21:55:24,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 09:55:23" (1/3) ... [2024-10-18 21:55:24,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3066b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:55:24, skipping insertion in model container [2024-10-18 21:55:24,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:55:23" (2/3) ... [2024-10-18 21:55:24,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3066b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:55:24, skipping insertion in model container [2024-10-18 21:55:24,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:55:24" (3/3) ... [2024-10-18 21:55:24,916 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-18 21:55:24,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 21:55:24,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-18 21:55:24,935 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 21:55:24,988 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-18 21:55:25,041 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:55:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:55:25,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:25,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 21:55:25,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 21:55:25,147 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:55:25,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:25,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-18 21:55:25,175 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;@3bb44093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:55:25,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 21:55:25,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:25,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-10-18 21:55:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501940828] [2024-10-18 21:55:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:25,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501940828] [2024-10-18 21:55:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501940828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:55:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:55:25,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:55:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050938190] [2024-10-18 21:55:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:55:25,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 21:55:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:55:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:55:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:25,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:25,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:25,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:26,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 21:55:26,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:26,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-10-18 21:55:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048669894] [2024-10-18 21:55:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:26,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048669894] [2024-10-18 21:55:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048669894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:26,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432920029] [2024-10-18 21:55:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:26,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:26,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 21:55:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:26,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 21:55:26,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:26,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432920029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:26,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-18 21:55:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140858849] [2024-10-18 21:55:26,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:26,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 21:55:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:26,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 21:55:26,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 21:55:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:26,375 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:26,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:26,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:26,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:26,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 21:55:26,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-18 21:55:26,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:26,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-10-18 21:55:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658182861] [2024-10-18 21:55:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:26,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658182861] [2024-10-18 21:55:26,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658182861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392646297] [2024-10-18 21:55:26,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 21:55:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:26,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:26,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-18 21:55:26,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 21:55:26,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:55:26,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 21:55:26,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:26,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:55:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392646297] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:27,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-18 21:55:27,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398642236] [2024-10-18 21:55:27,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:27,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 21:55:27,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:27,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 21:55:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-18 21:55:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:27,059 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:27,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:27,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:27,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:27,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:27,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 21:55:27,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:27,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-10-18 21:55:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725535141] [2024-10-18 21:55:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:27,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725535141] [2024-10-18 21:55:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725535141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805417647] [2024-10-18 21:55:27,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 21:55:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:27,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:27,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:27,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-18 21:55:27,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-18 21:55:27,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:55:27,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-18 21:55:27,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:27,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:55:28,007 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:55:28,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:55:28,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:55:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:55:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-10-18 21:55:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:28,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:36,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:55:36,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:55:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-18 21:55:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805417647] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:55:36,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:55:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-18 21:55:36,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329848583] [2024-10-18 21:55:36,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:55:36,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-18 21:55:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:55:36,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-18 21:55:36,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-18 21:55:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:36,405 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:55:36,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:55:36,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:36,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:36,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:36,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:55:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:55:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:55:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:55:36,593 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-18 21:55:36,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:36,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:55:36,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:55:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-10-18 21:55:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:55:36,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203060291] [2024-10-18 21:55:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:36,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:55:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:37,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:55:37,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203060291] [2024-10-18 21:55:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203060291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:55:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318717475] [2024-10-18 21:55:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:55:37,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:55:37,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:55:37,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:55:37,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 21:55:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:55:37,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-18 21:55:37,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:55:37,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:55:37,646 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:55:37,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:55:37,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:55:37,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:55:37,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-10-18 21:55:37,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-10-18 21:55:37,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-18 21:55:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:55:37,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:55:56,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-18 21:56:00,155 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:56:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-18 21:56:00,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318717475] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:56:00,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:56:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-18 21:56:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906918752] [2024-10-18 21:56:00,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:56:00,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-18 21:56:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:56:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-18 21:56:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=323, Unknown=7, NotChecked=78, Total=506 [2024-10-18 21:56:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:56:00,282 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:56:00,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:56:00,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:56:00,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:00,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:00,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:00,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:56:02,012 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:56:02,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 270 [2024-10-18 21:56:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash 699958603, now seen corresponding path program 1 times [2024-10-18 21:56:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:56:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:56:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:04,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 21:56:04,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-18 21:56:04,510 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:56:04,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1260 treesize of output 1120 [2024-10-18 21:56:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1377925723, now seen corresponding path program 1 times [2024-10-18 21:56:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:56:06,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:56:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:56:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:56:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:56:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:56:06,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-18 21:56:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-18 21:56:07,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:56:07,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:56:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-10-18 21:56:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:56:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954128801] [2024-10-18 21:56:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:56:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:56:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954128801] [2024-10-18 21:56:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954128801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:56:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23482600] [2024-10-18 21:56:07,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 21:56:07,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:56:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:56:07,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:56:07,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-18 21:56:07,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 21:56:07,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:56:07,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-18 21:56:07,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:56:07,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:56:07,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:56:07,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:56:07,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:56:08,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-18 21:56:08,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-18 21:56:08,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-18 21:56:11,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-18 21:56:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:11,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:56:23,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:24,997 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_457) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:26,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_457) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:28,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_454 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_457) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:56:30,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_454 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_457) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-18 21:56:32,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_453 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_453) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_454 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_457) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-18 21:56:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-18 21:56:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23482600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:56:33,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:56:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-18 21:56:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517496973] [2024-10-18 21:56:33,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:56:33,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-18 21:56:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:56:33,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-18 21:56:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=14, NotChecked=258, Total=702 [2024-10-18 21:56:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:56:33,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:56:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:56:33,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:56:33,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:33,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:33,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:56:33,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:56:33,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:56:40,739 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:56:40,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 561 [2024-10-18 21:56:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1010516248, now seen corresponding path program 1 times [2024-10-18 21:56:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:56:41,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:56:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:56:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:56:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:56:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:56:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:56:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:56:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 21:56:41,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 21:56:41,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-18 21:56:41,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:56:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:56:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-10-18 21:56:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:56:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637524628] [2024-10-18 21:56:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:56:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:56:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:56:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:56:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:56:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637524628] [2024-10-18 21:56:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637524628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:56:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787049754] [2024-10-18 21:56:46,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 21:56:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:56:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:56:46,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:56:46,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-18 21:56:47,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-18 21:56:47,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:56:47,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-18 21:56:47,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:56:47,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:56:47,175 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:56:47,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:56:47,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:56:47,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-18 21:56:47,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-18 21:56:50,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-18 21:56:53,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-18 21:57:00,679 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 70 treesize of output 57 [2024-10-18 21:57:14,887 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-18 21:57:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:57:14,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:57:44,896 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:46,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 21:57:48,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:50,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:57:52,994 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int 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_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-10-18 21:57:53,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-18 21:57:55,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 21:57:57,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_638 Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_638 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 21:57:59,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_638 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_638 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-18 21:58:01,368 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_638 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_643 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (= (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_636) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_638 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_643) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-18 21:58:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-18 21:58:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787049754] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:58:01,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:58:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2024-10-18 21:58:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558369055] [2024-10-18 21:58:01,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:58:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-18 21:58:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:58:01,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-18 21:58:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=909, Unknown=36, NotChecked=710, Total=1806 [2024-10-18 21:58:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:01,645 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:58:01,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-18 21:58:01,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:06,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 21:58:14,960 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:58:14,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 561 [2024-10-18 21:58:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1877605483, now seen corresponding path program 1 times [2024-10-18 21:58:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:58:17,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:58:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:58:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:58:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 21:58:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 21:58:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-18 21:58:17,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-18 21:58:17,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-10-18 21:58:17,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:17,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-10-18 21:58:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348913371] [2024-10-18 21:58:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348913371] [2024-10-18 21:58:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348913371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:58:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283172558] [2024-10-18 21:58:36,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 21:58:36,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:36,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:36,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 21:58:36,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-18 21:58:36,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 21:58:36,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:58:36,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-18 21:58:36,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:58:36,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:58:36,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:58:36,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:58:36,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:58:36,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-10-18 21:58:36,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-10-18 21:58:36,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-18 21:58:37,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-18 21:58:41,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-18 21:58:47,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-18 21:59:08,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2024-10-18 21:59:18,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 229 treesize of output 190 [2024-10-18 21:59:29,727 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-18 22:00:07,096 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 253 treesize of output 205 [2024-10-18 22:00:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-18 22:00:07,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:00:33,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2024-10-18 22:00:35,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_61|) 0))) is different from false [2024-10-18 22:00:37,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_925 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_925))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2024-10-18 22:00:37,606 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_923 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (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_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 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_61|) 0))) is different from false [2024-10-18 22:00:37,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_923 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))) is different from false [2024-10-18 22:00:37,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_923 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0)))))) is different from false [2024-10-18 22:00:39,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_923 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:00:41,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_921 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:00:44,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:00:46,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (= (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_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:00:48,188 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (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 (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:00:50,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (= (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_917 (- 1)))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:00:52,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:00:54,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:00:56,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (= (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 (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:00:58,873 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (= (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| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-18 22:01:01,060 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 84)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)))) is different from false [2024-10-18 22:01:03,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_923 Int) (v_ArrVal_921 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ v_ArrVal_921 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_923)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))) is different from false [2024-10-18 22:01:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-18 22:01:03,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283172558] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:01:03,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:01:03,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 23] total 59 [2024-10-18 22:01:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64199169] [2024-10-18 22:01:03,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:01:03,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-18 22:01:03,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:01:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-18 22:01:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1380, Unknown=69, NotChecked=1746, Total=3540 [2024-10-18 22:01:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:01:03,574 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:01:03,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.6) internal successors, (276), 59 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:01:03,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:01:03,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:01:03,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:01:03,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 22:01:03,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 22:01:03,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-18 22:01:03,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-18 22:01:03,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:01:05,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:07,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:09,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:17,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:19,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:21,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:23,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:25,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:41,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:42,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:44,124 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-18 22:01:46,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:47,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:54,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:56,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:57,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:01:59,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:01,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:09,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:11,647 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-18 22:02:14,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:30,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:49,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:51,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:53,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:55,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:57,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:02:59,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:01,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:05,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:07,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:09,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:11,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:13,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:15,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:03:40,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-18 22:03:42,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:02,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:04,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:06,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:08,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:10,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:12,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:14,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:16,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:24,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:26,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:28,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:30,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:32,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:04:34,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:09,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:15,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:17,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-18 22:05:19,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:22,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:24,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:25,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:27,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:29,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:42,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:45,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:05:47,341 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-18 22:06:01,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:03,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:19,962 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-18 22:06:21,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:25,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:27,157 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-18 22:06:29,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:31,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-18 22:06:32,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:34,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:36,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:38,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:40,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:42,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:44,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:46,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:25,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:27,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:29,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:31,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:34,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:07:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 22:07:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:07:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 22:07:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-18 22:07:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-18 22:07:34,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 22:07:34,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-18 22:07:35,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:07:35,045 INFO L414 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2024-10-18 22:07:35,046 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-18 22:07:35,052 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 22:07:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 22:07:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:07:35,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 22:07:35,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-18 22:07:35,095 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 22:07:35,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:35,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 22:07:35,096 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;@3bb44093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 22:07:35,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-18 22:07:35,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 22:07:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1200789139, now seen corresponding path program 1 times [2024-10-18 22:07:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451713452] [2024-10-18 22:07:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:07:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451713452] [2024-10-18 22:07:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451713452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 22:07:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 22:07:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 22:07:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320541502] [2024-10-18 22:07:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 22:07:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 22:07:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:35,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 22:07:35,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 22:07:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:35,302 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:35,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:35,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:35,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-18 22:07:35,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 22:07:35,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1217839688, now seen corresponding path program 1 times [2024-10-18 22:07:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87606222] [2024-10-18 22:07:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:07:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87606222] [2024-10-18 22:07:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87606222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:07:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388234371] [2024-10-18 22:07:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:35,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:07:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:07:35,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 22:07:35,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-18 22:07:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:35,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 22:07:35,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:07:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:35,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:07:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388234371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:07:35,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:07:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-18 22:07:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813430847] [2024-10-18 22:07:35,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:07:35,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 22:07:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 22:07:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 22:07:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:35,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:35,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:35,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:35,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-18 22:07:35,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-18 22:07:35,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 22:07:35,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2098879443, now seen corresponding path program 2 times [2024-10-18 22:07:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927248438] [2024-10-18 22:07:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:35,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:07:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927248438] [2024-10-18 22:07:35,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927248438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:07:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855559798] [2024-10-18 22:07:35,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 22:07:35,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:07:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:07:35,839 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 22:07:35,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-18 22:07:35,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 22:07:35,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 22:07:35,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 22:07:35,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:07:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:35,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:07:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 22:07:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855559798] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:07:36,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:07:36,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-18 22:07:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827392288] [2024-10-18 22:07:36,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:07:36,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 22:07:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 22:07:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-18 22:07:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:36,034 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:36,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:36,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:36,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:36,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:07:36,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-18 22:07:36,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:07:36,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 22:07:36,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1949456307, now seen corresponding path program 3 times [2024-10-18 22:07:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701315132] [2024-10-18 22:07:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 22:07:36,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 22:07:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 22:07:36,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 22:07:36,303 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 22:07:36,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-18 22:07:36,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-18 22:07:36,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-18 22:07:36,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-18 22:07:36,306 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-18 22:07:36,306 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-10-18 22:07:36,307 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 22:07:36,310 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 22:07:36,340 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-18 22:07:36,347 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 22:07:36,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 22:07:36,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:07:36,349 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 22:07:36,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-18 22:07:36,398 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 22:07:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:36,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-18 22:07:36,399 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;@3bb44093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 22:07:36,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 22:07:37,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 22:07:37,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1522027196, now seen corresponding path program 1 times [2024-10-18 22:07:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:37,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698904321] [2024-10-18 22:07:37,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-18 22:07:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:07:37,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698904321] [2024-10-18 22:07:37,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698904321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 22:07:37,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 22:07:37,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 22:07:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861755215] [2024-10-18 22:07:37,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 22:07:37,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 22:07:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:37,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 22:07:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 22:07:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:37,229 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:37,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:37,693 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 22:07:37,694 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 1164 treesize of output 1068 [2024-10-18 22:07:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1397039140, now seen corresponding path program 1 times [2024-10-18 22:07:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 22:07:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 22:07:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:40,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable17 [2024-10-18 22:07:40,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 22:07:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 83580736, now seen corresponding path program 1 times [2024-10-18 22:07:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:40,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499525915] [2024-10-18 22:07:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 22:07:40,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:07:40,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499525915] [2024-10-18 22:07:40,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499525915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:07:40,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273411383] [2024-10-18 22:07:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:40,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:07:40,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:07:40,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 22:07:40,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-18 22:07:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:40,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 22:07:40,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:07:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 22:07:40,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:07:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 22:07:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273411383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:07:40,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:07:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-18 22:07:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917748226] [2024-10-18 22:07:40,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:07:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 22:07:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 22:07:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 22:07:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:40,413 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:40,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:40,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:40,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:40,658 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 1134 treesize of output 1038 [2024-10-18 22:07:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash -861964487, now seen corresponding path program 1 times [2024-10-18 22:07:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:42,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 22:07:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 22:07:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:42,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-18 22:07:43,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2024-10-18 22:07:43,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 22:07:43,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:07:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash -924769858, now seen corresponding path program 2 times [2024-10-18 22:07:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:07:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447083225] [2024-10-18 22:07:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 22:07:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:07:43,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447083225] [2024-10-18 22:07:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447083225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:07:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781752306] [2024-10-18 22:07:43,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 22:07:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:07:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:07:43,213 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 22:07:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-18 22:07:43,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 22:07:43,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 22:07:43,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 22:07:43,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:07:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 22:07:43,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:07:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 22:07:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781752306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:07:43,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:07:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-18 22:07:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239105729] [2024-10-18 22:07:43,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:07:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 22:07:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:07:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 22:07:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-18 22:07:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:43,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:07:43,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:07:43,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:07:43,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:07:43,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:07:43,751 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 22:07:43,752 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 616 treesize of output 568 [2024-10-18 22:07:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash 650213370, now seen corresponding path program 1 times [2024-10-18 22:07:45,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:45,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 22:07:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-18 22:07:46,410 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 22:07:46,411 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 318 treesize of output 294 [2024-10-18 22:07:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash -233288937, now seen corresponding path program 1 times [2024-10-18 22:07:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:48,080 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 286 treesize of output 262 [2024-10-18 22:07:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -934322551, now seen corresponding path program 1 times [2024-10-18 22:07:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:50,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:50,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:50,936 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 22:07:50,937 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 316 treesize of output 292 [2024-10-18 22:07:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash 603162256, now seen corresponding path program 1 times [2024-10-18 22:07:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:52,756 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 22:07:52,757 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 1130 treesize of output 1034 [2024-10-18 22:07:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash 972603050, now seen corresponding path program 1 times [2024-10-18 22:07:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:55,592 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 288 treesize of output 264 [2024-10-18 22:07:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -343291013, now seen corresponding path program 1 times [2024-10-18 22:07:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:07:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:07:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:07:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:07:58,512 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 586 treesize of output 538 [2024-10-18 22:08:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2021220386, now seen corresponding path program 1 times [2024-10-18 22:08:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:08:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:08:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:08:01,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-18 22:08:01,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-18 22:08:01,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 22:08:01,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:08:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2091250142, now seen corresponding path program 3 times [2024-10-18 22:08:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:08:01,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106671066] [2024-10-18 22:08:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 310 proven. 135 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-18 22:08:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:08:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106671066] [2024-10-18 22:08:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106671066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:08:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204272442] [2024-10-18 22:08:01,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 22:08:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:08:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:08:01,966 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 22:08:01,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-18 22:08:02,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-18 22:08:02,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 22:08:02,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-18 22:08:02,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:08:02,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-18 22:08:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-18 22:08:02,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:08:02,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-10-18 22:08:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-18 22:08:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204272442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:08:02,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:08:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2024-10-18 22:08:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87048367] [2024-10-18 22:08:02,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:08:02,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-18 22:08:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:08:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-18 22:08:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-10-18 22:08:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:08:02,675 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:08:02,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.0) internal successors, (180), 18 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 22:08:02,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:08:02,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:08:02,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:08:02,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:08:03,784 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 646 treesize of output 598 [2024-10-18 22:08:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 407191645, now seen corresponding path program 1 times [2024-10-18 22:08:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:04,569 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 554 treesize of output 506 [2024-10-18 22:08:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1029930713, now seen corresponding path program 1 times [2024-10-18 22:08:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:07,233 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-18 22:08:07,233 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 618 treesize of output 568 [2024-10-18 22:08:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash -312608304, now seen corresponding path program 1 times [2024-10-18 22:08:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:08:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:08:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:08:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:08:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:08:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-18 22:08:09,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-18 22:08:10,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-10-18 22:08:10,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 22:08:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:08:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash 374679864, now seen corresponding path program 4 times [2024-10-18 22:08:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:08:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272195473] [2024-10-18 22:08:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:08:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:08:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15