./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --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_79-equ_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --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-19 03:44:22,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 03:44:22,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 03:44:22,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 03:44:22,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 03:44:22,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 03:44:22,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 03:44:22,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 03:44:22,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 03:44:22,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 03:44:22,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 03:44:22,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 03:44:22,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 03:44:22,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 03:44:22,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 03:44:22,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 03:44:22,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 03:44:22,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 03:44:22,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 03:44:22,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 03:44:22,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 03:44:22,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 03:44:22,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 03:44:22,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 03:44:22,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 03:44:22,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 03:44:22,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 03:44:22,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 03:44:22,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 03:44:22,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 03:44:22,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 03:44:22,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 03:44:22,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 03:44:22,428 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 03:44:22,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 03:44:22,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 03:44:22,430 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 03:44:22,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 03:44:22,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 03:44:22,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 03:44:22,431 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 03:44:22,431 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 -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc 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 -> SLEEP_SET 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-19 03:44:22,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 03:44:22,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 03:44:22,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 03:44:22,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 03:44:22,728 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 03:44:22,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i [2024-10-19 03:44:24,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 03:44:24,484 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 03:44:24,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i [2024-10-19 03:44:24,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f013e3204/aa234a09124b4c3e8e8ebaf4e5e1af0a/FLAGa537cc40e [2024-10-19 03:44:24,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f013e3204/aa234a09124b4c3e8e8ebaf4e5e1af0a [2024-10-19 03:44:24,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 03:44:24,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 03:44:24,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 03:44:24,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 03:44:24,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 03:44:24,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 03:44:24" (1/1) ... [2024-10-19 03:44:24,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159b8a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:24, skipping insertion in model container [2024-10-19 03:44:24,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 03:44:24" (1/1) ... [2024-10-19 03:44:24,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 03:44:24,996 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_79-equ_racefree.i[47038,47051] [2024-10-19 03:44:25,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 03:44:25,043 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 03:44:25,087 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_79-equ_racefree.i[47038,47051] [2024-10-19 03:44:25,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 03:44:25,164 INFO L204 MainTranslator]: Completed translation [2024-10-19 03:44:25,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25 WrapperNode [2024-10-19 03:44:25,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 03:44:25,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 03:44:25,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 03:44:25,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 03:44:25,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,222 INFO L138 Inliner]: procedures = 272, calls = 64, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 226 [2024-10-19 03:44:25,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 03:44:25,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 03:44:25,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 03:44:25,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 03:44:25,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 03:44:25,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 03:44:25,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 03:44:25,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 03:44:25,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (1/1) ... [2024-10-19 03:44:25,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 03:44:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:44:25,306 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-19 03:44:25,310 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-19 03:44:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 03:44:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 03:44:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 03:44:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 03:44:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 03:44:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 03:44:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 03:44:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-19 03:44:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-19 03:44:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 03:44:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 03:44:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 03:44:25,366 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 03:44:25,480 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 03:44:25,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 03:44:25,816 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 03:44:25,817 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 03:44:26,122 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 03:44:26,123 INFO L314 CfgBuilder]: Removed 22 assume(true) statements. [2024-10-19 03:44:26,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:44:26 BoogieIcfgContainer [2024-10-19 03:44:26,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 03:44:26,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 03:44:26,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 03:44:26,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 03:44:26,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 03:44:24" (1/3) ... [2024-10-19 03:44:26,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2504cea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 03:44:26, skipping insertion in model container [2024-10-19 03:44:26,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:44:25" (2/3) ... [2024-10-19 03:44:26,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2504cea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 03:44:26, skipping insertion in model container [2024-10-19 03:44:26,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:44:26" (3/3) ... [2024-10-19 03:44:26,136 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2024-10-19 03:44:26,149 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 03:44:26,149 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 03:44:26,149 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 03:44:26,188 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-19 03:44:26,231 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:44:26,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:44:26,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:44:26,235 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-19 03:44:26,237 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-19 03:44:26,315 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:44:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:26,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-19 03:44:26,343 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:44:26,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:44:26,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:44:26,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1633563581, now seen corresponding path program 1 times [2024-10-19 03:44:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:44:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160803170] [2024-10-19 03:44:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 03:44:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:44:27,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160803170] [2024-10-19 03:44:27,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160803170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:44:27,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:44:27,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:44:27,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514745244] [2024-10-19 03:44:27,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:44:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 03:44:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:44:27,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:44:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:44:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:27,254 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:44:27,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-19 03:44:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:28,769 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 03:44:28,771 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 41 treesize of output 33 [2024-10-19 03:44:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2093968517, now seen corresponding path program 1 times [2024-10-19 03:44:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:28,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:44:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:44:29,426 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:29,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:44:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 983998769, now seen corresponding path program 1 times [2024-10-19 03:44:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:29,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:29,830 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:29,831 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 601 treesize of output 533 [2024-10-19 03:44:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1932313437, now seen corresponding path program 1 times [2024-10-19 03:44:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:32,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:32,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-19 03:44:32,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:44:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -57152170, now seen corresponding path program 1 times [2024-10-19 03:44:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:44:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472352980] [2024-10-19 03:44:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:44:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:44:32,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472352980] [2024-10-19 03:44:32,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472352980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:44:32,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819211891] [2024-10-19 03:44:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:32,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:44:32,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:44:32,418 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-19 03:44:32,421 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-19 03:44:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:32,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 03:44:32,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:44:32,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:44:32,535 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-19 03:44:32,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:44:32,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:44:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:44:32,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:44:32,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_142 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_142) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:44:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-10-19 03:44:32,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819211891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:44:32,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:44:32,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-19 03:44:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031324275] [2024-10-19 03:44:32,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:44:32,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 03:44:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:44:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 03:44:32,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2024-10-19 03:44:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:32,745 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:44:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-19 03:44:32,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:32,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:33,019 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:33,020 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-19 03:44:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1932313418, now seen corresponding path program 1 times [2024-10-19 03:44:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:33,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:44:33,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:44:33,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-19 03:44:33,930 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,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-19 03:44:33,941 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-19 03:44:33,943 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-19 03:44:33,947 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:44:33,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:44:33,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:44:33,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 03:44:33,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-19 03:44:33,994 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:44:33,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:33,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 03:44:33,999 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:44:34,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 03:44:34,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:44:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 983040905, now seen corresponding path program 1 times [2024-10-19 03:44:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:44:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119457104] [2024-10-19 03:44:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:34,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:44:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119457104] [2024-10-19 03:44:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119457104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:44:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:44:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:44:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668931646] [2024-10-19 03:44:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:44:34,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 03:44:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:44:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:44:34,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:44:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:34,280 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:44:34,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-19 03:44:34,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:44:34,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-19 03:44:34,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:44:34,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash 863023594, now seen corresponding path program 1 times [2024-10-19 03:44:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:44:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115550083] [2024-10-19 03:44:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:34,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:34,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 03:44:34,392 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 03:44:34,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 03:44:34,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 03:44:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-19 03:44:34,395 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-19 03:44:34,395 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-19 03:44:34,396 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 03:44:34,396 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-19 03:44:34,412 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 03:44:34,416 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:44:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:44:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:44:34,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 03:44:34,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-19 03:44:34,465 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:44:34,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:44:34,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-19 03:44:34,467 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:44:34,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:44:35,942 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:35,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:44:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash -692852619, now seen corresponding path program 1 times [2024-10-19 03:44:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:36,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:44:36,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:44:37,104 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:37,104 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-19 03:44:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash -410886903, now seen corresponding path program 1 times [2024-10-19 03:44:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:44:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:44:40,009 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 602 treesize of output 554 [2024-10-19 03:44:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -682674302, now seen corresponding path program 1 times [2024-10-19 03:44:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:44:42,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:44:44,136 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-19 03:44:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 824632837, now seen corresponding path program 1 times [2024-10-19 03:44:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:44:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-19 03:44:44,907 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 03:44:44,908 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 634 treesize of output 584 [2024-10-19 03:44:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1775525142, now seen corresponding path program 1 times [2024-10-19 03:44:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:44:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:44:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 03:44:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-19 03:44:45,580 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:45,581 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-19 03:44:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -52602577, now seen corresponding path program 1 times [2024-10-19 03:44:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:47,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:47,982 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:47,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:44:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 599432588, now seen corresponding path program 1 times [2024-10-19 03:44:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:48,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:48,381 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:48,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:44:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1292474160, now seen corresponding path program 1 times [2024-10-19 03:44:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:50,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:50,773 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:50,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:44:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash 537301744, now seen corresponding path program 1 times [2024-10-19 03:44:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:52,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:53,270 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 27 [2024-10-19 03:44:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash -457333168, now seen corresponding path program 1 times [2024-10-19 03:44:53,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:53,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:53,782 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:53,782 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 601 treesize of output 533 [2024-10-19 03:44:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash -423100293, now seen corresponding path program 1 times [2024-10-19 03:44:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:55,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:56,143 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:56,143 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-19 03:44:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1270802097, now seen corresponding path program 1 times [2024-10-19 03:44:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:58,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:58,545 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 27 [2024-10-19 03:44:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 124900493, now seen corresponding path program 1 times [2024-10-19 03:44:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:58,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:58,923 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:58,924 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 1292 treesize of output 1152 [2024-10-19 03:44:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1805753026, now seen corresponding path program 1 times [2024-10-19 03:44:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:59,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:59,156 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:59,157 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-19 03:44:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1053641873, now seen corresponding path program 1 times [2024-10-19 03:44:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:44:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:44:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:59,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:44:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:44:59,417 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:44:59,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:45:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1560198238, now seen corresponding path program 1 times [2024-10-19 03:45:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:01,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:01,715 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:01,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:45:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2041362683, now seen corresponding path program 1 times [2024-10-19 03:45:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:01,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:02,005 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:02,005 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 1160 treesize of output 1020 [2024-10-19 03:45:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash -506426968, now seen corresponding path program 1 times [2024-10-19 03:45:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 03:45:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-19 03:45:04,732 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:04,732 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 601 treesize of output 533 [2024-10-19 03:45:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -52602486, now seen corresponding path program 1 times [2024-10-19 03:45:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:06,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:07,032 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:07,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:45:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash 599432673, now seen corresponding path program 1 times [2024-10-19 03:45:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:07,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:07,291 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:07,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:45:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1292474083, now seen corresponding path program 1 times [2024-10-19 03:45:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:07,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:07,614 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:07,615 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 1216 treesize of output 1076 [2024-10-19 03:45:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash 537301817, now seen corresponding path program 1 times [2024-10-19 03:45:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:07,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:08,266 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 27 [2024-10-19 03:45:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash -457333097, now seen corresponding path program 1 times [2024-10-19 03:45:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:10,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:10,561 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:10,562 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 1216 treesize of output 1076 [2024-10-19 03:45:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash -423100226, now seen corresponding path program 1 times [2024-10-19 03:45:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:10,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:10,837 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:10,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:45:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1270802164, now seen corresponding path program 1 times [2024-10-19 03:45:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:10,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:11,238 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 27 [2024-10-19 03:45:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 124900560, now seen corresponding path program 1 times [2024-10-19 03:45:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:13,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:13,480 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:13,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:45:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1805752963, now seen corresponding path program 1 times [2024-10-19 03:45:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:13,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:13,754 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:13,755 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 2466 treesize of output 2182 [2024-10-19 03:45:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1053641936, now seen corresponding path program 1 times [2024-10-19 03:45:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:15,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:16,245 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 27 [2024-10-19 03:45:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash -668620395, now seen corresponding path program 1 times [2024-10-19 03:45:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:18,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:18,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:45:18,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 856876901, now seen corresponding path program 1 times [2024-10-19 03:45:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250915337] [2024-10-19 03:45:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:45:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250915337] [2024-10-19 03:45:19,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250915337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:45:19,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924616447] [2024-10-19 03:45:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:45:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:45:19,069 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-19 03:45:19,072 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-19 03:45:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:19,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 03:45:19,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:45:19,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:45:19,283 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-19 03:45:19,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:45:19,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:45:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:45:19,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924616447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:45:19,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:45:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-19 03:45:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571848628] [2024-10-19 03:45:19,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:45:19,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 03:45:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 03:45:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=77, Unknown=3, NotChecked=0, Total=110 [2024-10-19 03:45:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:19,543 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:19,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-19 03:45:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:45:21,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-19 03:45:21,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-19 03:45:21,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:45:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -790374893, now seen corresponding path program 1 times [2024-10-19 03:45:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055401677] [2024-10-19 03:45:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 03:45:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:21,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055401677] [2024-10-19 03:45:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055401677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:45:21,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467103075] [2024-10-19 03:45:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:21,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:45:21,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:45:21,730 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-19 03:45:21,732 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-19 03:45:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:21,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-19 03:45:21,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:45:21,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:45:21,911 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-19 03:45:21,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:21,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:22,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:22,098 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 19 treesize of output 11 [2024-10-19 03:45:22,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 19 treesize of output 11 [2024-10-19 03:45:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 03:45:22,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:45:22,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:45:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2024-10-19 03:45:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467103075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:45:22,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:45:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-19 03:45:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358437960] [2024-10-19 03:45:22,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:45:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-19 03:45:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-19 03:45:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2024-10-19 03:45:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:22,363 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:22,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 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-19 03:45:22,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:45:22,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:45:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 03:45:24,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-19 03:45:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-10-19 03:45:24,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:45:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -17642157, now seen corresponding path program 2 times [2024-10-19 03:45:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844573414] [2024-10-19 03:45:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 03:45:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844573414] [2024-10-19 03:45:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844573414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:45:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747397317] [2024-10-19 03:45:24,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 03:45:24,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:45:24,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:45:24,510 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-19 03:45:24,511 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-19 03:45:24,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 03:45:24,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 03:45:24,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-19 03:45:24,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:45:24,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:45:24,679 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-19 03:45:24,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:24,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:24,804 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 19 treesize of output 11 [2024-10-19 03:45:24,844 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 19 treesize of output 11 [2024-10-19 03:45:24,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:45:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 03:45:24,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:45:24,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1314) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:45:24,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1314) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:45:24,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1314) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:45:25,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1309 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1309) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1314) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:45:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-19 03:45:25,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747397317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:45:25,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:45:25,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-10-19 03:45:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117645288] [2024-10-19 03:45:25,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:45:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-19 03:45:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-19 03:45:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=105, Unknown=4, NotChecked=92, Total=240 [2024-10-19 03:45:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:25,092 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 15 states have internal predecessors, (95), 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-19 03:45:25,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:45:25,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 03:45:25,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:45:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 03:45:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 03:45:27,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:45:27,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-19 03:45:27,585 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,SelfDestructingSolverStorable46 [2024-10-19 03:45:27,588 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 03:45:27,588 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-19 03:45:27,591 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:45:27,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:45:27,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:45:27,593 INFO L229 MonitoredProcess]: Starting monitored process 9 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-19 03:45:27,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-10-19 03:45:27,625 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:45:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:27,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 03:45:27,626 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:45:27,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 03:45:28,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:28,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash -111308011, now seen corresponding path program 1 times [2024-10-19 03:45:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876534238] [2024-10-19 03:45:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 03:45:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876534238] [2024-10-19 03:45:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876534238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:45:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:45:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:45:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074009789] [2024-10-19 03:45:28,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:45:28,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 03:45:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:45:28,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:45:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,081 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:28,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 03:45:28,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-19 03:45:28,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:28,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash -992195672, now seen corresponding path program 1 times [2024-10-19 03:45:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985969931] [2024-10-19 03:45:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:28,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985969931] [2024-10-19 03:45:28,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985969931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:45:28,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:45:28,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:45:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132084279] [2024-10-19 03:45:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:45:28,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 03:45:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:45:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:45:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,411 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 03:45:28,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:45:28,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-19 03:45:28,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash -52605563, now seen corresponding path program 1 times [2024-10-19 03:45:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264997834] [2024-10-19 03:45:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:28,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:28,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 03:45:28,548 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 03:45:28,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 03:45:28,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 03:45:28,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-19 03:45:28,551 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-19 03:45:28,551 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-19 03:45:28,551 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 03:45:28,551 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-19 03:45:28,583 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-19 03:45:28,588 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:45:28,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:45:28,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:45:28,591 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-19 03:45:28,594 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-19 03:45:28,633 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:45:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:28,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 03:45:28,635 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:45:28,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 03:45:29,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1545376050, now seen corresponding path program 1 times [2024-10-19 03:45:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007679941] [2024-10-19 03:45:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 03:45:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007679941] [2024-10-19 03:45:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007679941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:45:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:45:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:45:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904220458] [2024-10-19 03:45:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:45:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 03:45:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:45:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:45:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:29,275 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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-19 03:45:29,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-19 03:45:30,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2003634086, now seen corresponding path program 1 times [2024-10-19 03:45:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608266083] [2024-10-19 03:45:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 03:45:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608266083] [2024-10-19 03:45:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608266083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:45:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:45:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:45:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389971137] [2024-10-19 03:45:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:45:30,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 03:45:30,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:45:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:45:30,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,061 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:30,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-19 03:45:30,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:45:30,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-19 03:45:30,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1446988020, now seen corresponding path program 1 times [2024-10-19 03:45:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834237462] [2024-10-19 03:45:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 03:45:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834237462] [2024-10-19 03:45:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834237462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:45:30,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:45:30,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 03:45:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014205761] [2024-10-19 03:45:30,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:45:30,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 03:45:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 03:45:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 03:45:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,660 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:30,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-19 03:45:30,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:45:30,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:45:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:45:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-19 03:45:30,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:45:30,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1433131533, now seen corresponding path program 1 times [2024-10-19 03:45:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064218573] [2024-10-19 03:45:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:30,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:45:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:45:30,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 03:45:30,827 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 03:45:30,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 03:45:30,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 03:45:30,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-19 03:45:30,829 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-19 03:45:30,830 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-19 03:45:30,830 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 03:45:30,830 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-19 03:45:30,858 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 03:45:30,860 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:45:30,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:45:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:45:30,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 03:45:30,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-10-19 03:45:30,912 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:45:30,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:30,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-19 03:45:30,913 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:45:30,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:45:32,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:45:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:45:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 192741333, now seen corresponding path program 1 times [2024-10-19 03:45:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:45:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358877115] [2024-10-19 03:45:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-19 03:45:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:45:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358877115] [2024-10-19 03:45:32,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358877115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:45:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:45:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:45:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480989413] [2024-10-19 03:45:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:45:32,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 03:45:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:45:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:45:32,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:45:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:32,367 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:45:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-19 03:45:32,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:45:34,540 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:34,541 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 1142 treesize of output 1046 [2024-10-19 03:45:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2088424369, now seen corresponding path program 1 times [2024-10-19 03:45:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:36,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:45:36,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:45:37,792 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:45:37,793 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 296 treesize of output 272 [2024-10-19 03:45:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1993991792, now seen corresponding path program 1 times [2024-10-19 03:45:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:40,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:45:40,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:45:59,094 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 03:45:59,095 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 298 treesize of output 272 [2024-10-19 03:45:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash -269098257, now seen corresponding path program 1 times [2024-10-19 03:45:59,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:59,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:45:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:45:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:45:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:45:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 03:45:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-19 03:46:07,865 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:46:07,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:46:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1116531481, now seen corresponding path program 1 times [2024-10-19 03:46:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:46:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-19 03:46:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:46:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-19 03:46:08,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:46:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:46:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 722563718, now seen corresponding path program 1 times [2024-10-19 03:46:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:46:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971518171] [2024-10-19 03:46:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:46:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:46:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971518171] [2024-10-19 03:46:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971518171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:46:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430875147] [2024-10-19 03:46:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:46:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:46:09,475 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-19 03:46:09,476 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-19 03:46:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:09,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-19 03:46:09,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:46:09,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:46:09,703 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-19 03:46:09,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:46:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:46:09,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:46:09,825 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 19 treesize of output 11 [2024-10-19 03:46:09,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:46:09,896 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 19 treesize of output 11 [2024-10-19 03:46:09,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:46:09,986 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 19 treesize of output 11 [2024-10-19 03:46:10,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-19 03:46:10,067 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 19 treesize of output 11 [2024-10-19 03:46:10,086 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 19 treesize of output 11 [2024-10-19 03:46:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:46:10,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:46:10,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))) is different from false [2024-10-19 03:46:10,235 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:46:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2024-10-19 03:46:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430875147] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:46:10,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:46:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 16 [2024-10-19 03:46:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075669335] [2024-10-19 03:46:10,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:46:10,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-19 03:46:10,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:46:10,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-19 03:46:10,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=166, Unknown=5, NotChecked=54, Total=272 [2024-10-19 03:46:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:46:10,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:46:10,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.705882352941176) internal successors, (182), 16 states have internal predecessors, (182), 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-19 03:46:10,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:46:10,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:46:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:46:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 03:46:46,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:46:46,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-19 03:46:46,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:46:46,562 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-19 03:46:46,562 INFO L312 ceAbstractionStarter]: Result for error location t_funThread4of4ForFork0 was SAFE (1/5) [2024-10-19 03:46:46,564 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:46:46,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:46:46,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:46:46,567 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-19 03:46:46,568 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-19 03:46:46,612 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:46:46,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:46:46,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread2of4ForFork0 ======== [2024-10-19 03:46:46,613 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:46:46,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:46:48,161 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:46:48,161 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 601 treesize of output 533 [2024-10-19 03:46:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1332694214, now seen corresponding path program 1 times [2024-10-19 03:46:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:46:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:46:53,130 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:46:53,131 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 1142 treesize of output 1046 [2024-10-19 03:46:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -862643612, now seen corresponding path program 1 times [2024-10-19 03:46:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:46:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:46:56,442 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:46:56,443 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 562 treesize of output 514 [2024-10-19 03:46:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1047561357, now seen corresponding path program 1 times [2024-10-19 03:46:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:46:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:46:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:46:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:46:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:46:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:46:59,034 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:46:59,035 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-19 03:47:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash -446043065, now seen corresponding path program 1 times [2024-10-19 03:47:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:47:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-19 03:47:04,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:47:04,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:47:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -74921314, now seen corresponding path program 1 times [2024-10-19 03:47:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:47:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353088190] [2024-10-19 03:47:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-19 03:47:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:47:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353088190] [2024-10-19 03:47:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353088190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:47:04,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:47:04,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:47:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582320529] [2024-10-19 03:47:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:47:04,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 03:47:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:47:04,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:47:04,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:47:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:04,796 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:47:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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-19 03:47:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:47:05,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-10-19 03:47:05,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:47:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:47:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1004339901, now seen corresponding path program 1 times [2024-10-19 03:47:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:47:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709512602] [2024-10-19 03:47:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:47:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:47:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709512602] [2024-10-19 03:47:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709512602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:47:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272973413] [2024-10-19 03:47:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:05,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:47:05,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:47:05,374 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-19 03:47:05,375 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-19 03:47:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:05,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-19 03:47:05,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:47:05,603 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:47:05,603 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-19 03:47:05,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:05,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:05,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:05,718 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 19 treesize of output 11 [2024-10-19 03:47:05,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:05,780 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 19 treesize of output 11 [2024-10-19 03:47:05,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:47:05,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:47:05,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2702) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:47:05,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2702 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2702) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:47:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2024-10-19 03:47:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272973413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:47:06,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:47:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 14 [2024-10-19 03:47:06,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143963071] [2024-10-19 03:47:06,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:47:06,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-19 03:47:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:47:06,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-19 03:47:06,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=122, Unknown=3, NotChecked=46, Total=210 [2024-10-19 03:47:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:06,118 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:47:06,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 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-19 03:47:06,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:47:06,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:10,765 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 03:47:10,765 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 41 treesize of output 33 [2024-10-19 03:47:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 497182321, now seen corresponding path program 1 times [2024-10-19 03:47:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 03:47:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-19 03:47:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:47:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 03:47:48,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:47:48,542 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-19 03:47:48,728 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,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75 [2024-10-19 03:47:48,732 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-19 03:47:48,732 INFO L312 ceAbstractionStarter]: Result for error location t_funThread2of4ForFork0 was SAFE (2/5) [2024-10-19 03:47:48,736 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:47:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:47:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:47:48,738 INFO L229 MonitoredProcess]: Starting monitored process 15 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-19 03:47:48,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-19 03:47:48,778 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:47:48,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:47:48,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread3of4ForFork0 ======== [2024-10-19 03:47:48,779 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:47:48,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:47:50,365 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:47:50,366 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 601 treesize of output 533 [2024-10-19 03:47:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1332698681, now seen corresponding path program 1 times [2024-10-19 03:47:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:47:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:47:54,802 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-19 03:47:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash 33242845, now seen corresponding path program 1 times [2024-10-19 03:47:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:47:55,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:47:56,055 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:47:56,055 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 1152 treesize of output 1056 [2024-10-19 03:47:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -61189732, now seen corresponding path program 1 times [2024-10-19 03:47:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:47:56,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:47:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:47:57,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:47:57,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:47:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash 958392318, now seen corresponding path program 1 times [2024-10-19 03:47:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:47:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955118829] [2024-10-19 03:47:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:57,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-19 03:47:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:47:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955118829] [2024-10-19 03:47:57,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955118829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:47:57,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:47:57,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:47:57,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607088600] [2024-10-19 03:47:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:47:57,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 03:47:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:47:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:47:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:47:57,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:57,549 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:47:57,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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-19 03:47:57,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:47:58,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-10-19 03:47:58,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:47:58,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:47:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1464122889, now seen corresponding path program 1 times [2024-10-19 03:47:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:47:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787091536] [2024-10-19 03:47:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:47:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:47:58,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:47:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787091536] [2024-10-19 03:47:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787091536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:47:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335017868] [2024-10-19 03:47:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:47:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:47:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:47:58,584 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-19 03:47:58,586 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-19 03:47:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:47:58,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-19 03:47:58,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:47:58,837 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:47:58,838 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-19 03:47:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:58,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:58,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:58,966 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 19 treesize of output 11 [2024-10-19 03:47:59,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:59,029 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 19 treesize of output 11 [2024-10-19 03:47:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:47:59,116 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 19 treesize of output 11 [2024-10-19 03:47:59,147 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 19 treesize of output 11 [2024-10-19 03:47:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:47:59,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:47:59,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3379 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3379) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:47:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 3 times theorem prover too weak. 9 trivial. 7 not checked. [2024-10-19 03:47:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335017868] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:47:59,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:47:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 16 [2024-10-19 03:47:59,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175229305] [2024-10-19 03:47:59,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:47:59,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-19 03:47:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:47:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-19 03:47:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=185, Unknown=9, NotChecked=28, Total=272 [2024-10-19 03:47:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:47:59,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:47:59,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 16 states have internal predecessors, (144), 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-19 03:47:59,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:47:59,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:48:04,386 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 03:48:04,387 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 41 treesize of output 33 [2024-10-19 03:48:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1835961621, now seen corresponding path program 1 times [2024-10-19 03:48:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:04,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:04,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 03:48:04,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-19 03:48:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:48:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 03:48:40,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:48:40,211 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-19 03:48:40,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:48:40,400 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-19 03:48:40,401 INFO L312 ceAbstractionStarter]: Result for error location t_funThread3of4ForFork0 was SAFE (3/5) [2024-10-19 03:48:40,404 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:48:40,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:48:40,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:48:40,405 INFO L229 MonitoredProcess]: Starting monitored process 17 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-19 03:48:40,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-10-19 03:48:40,443 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:48:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:48:40,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of4ForFork0 ======== [2024-10-19 03:48:40,444 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:48:40,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:48:42,160 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:48:42,160 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 1292 treesize of output 1152 [2024-10-19 03:48:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1332702859, now seen corresponding path program 1 times [2024-10-19 03:48:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:48:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:48:44,816 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:48:44,816 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-19 03:48:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1678504121, now seen corresponding path program 1 times [2024-10-19 03:48:46,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:46,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:48:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:48:47,864 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:48:47,865 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 296 treesize of output 272 [2024-10-19 03:48:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1059136026, now seen corresponding path program 1 times [2024-10-19 03:48:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:48:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:48:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:48:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:48:50,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:48:50,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:49:02,258 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:02,259 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 601 treesize of output 533 [2024-10-19 03:49:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1116517952, now seen corresponding path program 1 times [2024-10-19 03:49:02,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:49:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:49:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:49:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:49:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:49:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-19 03:49:03,551 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:03,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:49:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash -18389043, now seen corresponding path program 1 times [2024-10-19 03:49:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:03,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:03,862 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:03,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:49:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1378923083, now seen corresponding path program 1 times [2024-10-19 03:49:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:03,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:04,150 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:04,151 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 601 treesize of output 533 [2024-10-19 03:49:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash -619506967, now seen corresponding path program 1 times [2024-10-19 03:49:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:04,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:04,462 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:04,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:49:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2107783672, now seen corresponding path program 1 times [2024-10-19 03:49:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:04,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:04,913 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:04,914 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 601 treesize of output 533 [2024-10-19 03:49:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -959281434, now seen corresponding path program 1 times [2024-10-19 03:49:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:05,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:05,278 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:05,278 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-19 03:49:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1404673695, now seen corresponding path program 1 times [2024-10-19 03:49:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:05,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:05,672 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 27 [2024-10-19 03:49:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -308021409, now seen corresponding path program 1 times [2024-10-19 03:49:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:07,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:07,994 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:07,994 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 2354 treesize of output 2070 [2024-10-19 03:49:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash -387381617, now seen corresponding path program 1 times [2024-10-19 03:49:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:08,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:08,245 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:08,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:49:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1131128542, now seen corresponding path program 1 times [2024-10-19 03:49:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:10,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:10,619 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 27 [2024-10-19 03:49:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash -705215010, now seen corresponding path program 1 times [2024-10-19 03:49:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:10,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:10,984 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 27 [2024-10-19 03:49:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -574155670, now seen corresponding path program 1 times [2024-10-19 03:49:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:13,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:13,311 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:13,311 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 1216 treesize of output 1076 [2024-10-19 03:49:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash -539922795, now seen corresponding path program 1 times [2024-10-19 03:49:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:13,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:13,530 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:13,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2562 treesize of output 2278 [2024-10-19 03:49:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash -892717010, now seen corresponding path program 1 times [2024-10-19 03:49:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:15,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:15,821 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:15,822 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 2466 treesize of output 2182 [2024-10-19 03:49:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1404321608, now seen corresponding path program 1 times [2024-10-19 03:49:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:15,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:16,122 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:16,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:49:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -87532231, now seen corresponding path program 1 times [2024-10-19 03:49:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:16,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:16,450 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 27 [2024-10-19 03:49:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1015149877, now seen corresponding path program 1 times [2024-10-19 03:49:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:18,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:18,668 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:18,668 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 1216 treesize of output 1076 [2024-10-19 03:49:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash 935789663, now seen corresponding path program 1 times [2024-10-19 03:49:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:18,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:18,921 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:18,922 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 1292 treesize of output 1152 [2024-10-19 03:49:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 344756468, now seen corresponding path program 1 times [2024-10-19 03:49:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:19,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:19,285 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 27 [2024-10-19 03:49:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1000035952, now seen corresponding path program 1 times [2024-10-19 03:49:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:21,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:21,602 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 27 [2024-10-19 03:49:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -987230404, now seen corresponding path program 1 times [2024-10-19 03:49:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:23,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:23,873 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:23,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:49:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1517812292, now seen corresponding path program 1 times [2024-10-19 03:49:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:23,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:24,106 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:24,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:49:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash 735229313, now seen corresponding path program 1 times [2024-10-19 03:49:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:26,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:26,638 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 27 [2024-10-19 03:49:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1059399171, now seen corresponding path program 1 times [2024-10-19 03:49:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:26,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:26,991 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 27 [2024-10-19 03:49:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1609839279, now seen corresponding path program 1 times [2024-10-19 03:49:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:29,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:29,211 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:29,212 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 601 treesize of output 533 [2024-10-19 03:49:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash -338139643, now seen corresponding path program 1 times [2024-10-19 03:49:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:30,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:30,141 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:30,142 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 1160 treesize of output 1020 [2024-10-19 03:49:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 990310528, now seen corresponding path program 1 times [2024-10-19 03:49:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:30,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:30,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:30,524 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 27 [2024-10-19 03:49:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -287984580, now seen corresponding path program 1 times [2024-10-19 03:49:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:32,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:32,889 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 27 [2024-10-19 03:49:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1940237980, now seen corresponding path program 1 times [2024-10-19 03:49:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:34,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:35,707 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:35,707 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-19 03:49:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1072521911, now seen corresponding path program 1 times [2024-10-19 03:49:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:37,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:37,928 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:37,928 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 613 treesize of output 545 [2024-10-19 03:49:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1455875656, now seen corresponding path program 1 times [2024-10-19 03:49:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:38,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:38,230 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:38,231 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 613 treesize of output 545 [2024-10-19 03:49:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 760986341, now seen corresponding path program 1 times [2024-10-19 03:49:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:38,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:38,556 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:38,556 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 1216 treesize of output 1076 [2024-10-19 03:49:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1324478521, now seen corresponding path program 1 times [2024-10-19 03:49:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:38,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:39,098 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 27 [2024-10-19 03:49:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1915096747, now seen corresponding path program 1 times [2024-10-19 03:49:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:41,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:41,419 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:41,419 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 601 treesize of output 533 [2024-10-19 03:49:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1895759737, now seen corresponding path program 1 times [2024-10-19 03:49:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:43,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:43,677 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:43,678 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 2354 treesize of output 2070 [2024-10-19 03:49:43,753 INFO L85 PathProgramCache]: Analyzing trace with hash -499221159, now seen corresponding path program 1 times [2024-10-19 03:49:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:43,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:43,943 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 27 [2024-10-19 03:49:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash 77411765, now seen corresponding path program 1 times [2024-10-19 03:49:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:44,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:44,254 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 27 [2024-10-19 03:49:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash -727316206, now seen corresponding path program 1 times [2024-10-19 03:49:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:46,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:46,476 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:46,477 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 601 treesize of output 533 [2024-10-19 03:49:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash -358891159, now seen corresponding path program 1 times [2024-10-19 03:49:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:48,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:48,927 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:48,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:49:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1078628393, now seen corresponding path program 1 times [2024-10-19 03:49:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:49,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:49,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:50,064 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 27 [2024-10-19 03:49:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash 958272179, now seen corresponding path program 1 times [2024-10-19 03:49:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:52,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:52,250 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:52,250 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 1160 treesize of output 1020 [2024-10-19 03:49:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 992505048, now seen corresponding path program 1 times [2024-10-19 03:49:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:52,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:52,432 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:52,433 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 1292 treesize of output 1152 [2024-10-19 03:49:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1634333754, now seen corresponding path program 1 times [2024-10-19 03:49:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:54,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:54,702 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 27 [2024-10-19 03:49:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1278960278, now seen corresponding path program 1 times [2024-10-19 03:49:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:54,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:55,085 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:55,086 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 550 treesize of output 502 [2024-10-19 03:49:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1789066708, now seen corresponding path program 1 times [2024-10-19 03:49:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:49:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:49:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:49:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:49:55,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 03:49:55,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-19 03:49:57,603 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:49:57,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:49:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash -438761194, now seen corresponding path program 1 times [2024-10-19 03:49:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:49:59,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:49:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:49:59,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:49:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:00,948 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:00,948 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 601 treesize of output 533 [2024-10-19 03:50:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1873316004, now seen corresponding path program 1 times [2024-10-19 03:50:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:01,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:01,239 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:01,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:50:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash 337539707, now seen corresponding path program 1 times [2024-10-19 03:50:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:01,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:01,785 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:01,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:50:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash 37924353, now seen corresponding path program 1 times [2024-10-19 03:50:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:03,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:03,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:04,040 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:04,041 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 2466 treesize of output 2182 [2024-10-19 03:50:04,116 INFO L85 PathProgramCache]: Analyzing trace with hash 87577661, now seen corresponding path program 1 times [2024-10-19 03:50:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:04,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:04,215 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:04,215 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 1292 treesize of output 1152 [2024-10-19 03:50:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash -274254064, now seen corresponding path program 1 times [2024-10-19 03:50:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:04,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:04,402 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:04,402 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 601 treesize of output 533 [2024-10-19 03:50:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1672943702, now seen corresponding path program 1 times [2024-10-19 03:50:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:06,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:06,651 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:06,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-19 03:50:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1836012658, now seen corresponding path program 1 times [2024-10-19 03:50:08,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:08,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:09,615 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:09,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2562 treesize of output 2278 [2024-10-19 03:50:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1426944819, now seen corresponding path program 1 times [2024-10-19 03:50:11,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:11,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:11,902 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:11,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2562 treesize of output 2278 [2024-10-19 03:50:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 513750510, now seen corresponding path program 1 times [2024-10-19 03:50:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:11,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:13,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:50:13,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1486296914, now seen corresponding path program 1 times [2024-10-19 03:50:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:50:13,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859730544] [2024-10-19 03:50:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:50:13,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:50:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859730544] [2024-10-19 03:50:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859730544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:50:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853948889] [2024-10-19 03:50:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:13,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:50:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:50:13,571 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 03:50:13,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-19 03:50:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:13,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 03:50:13,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:50:13,924 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:50:13,924 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-19 03:50:13,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:13,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 03:50:14,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:50:14,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6705) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:50:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-19 03:50:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853948889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:50:14,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:50:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-19 03:50:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697347777] [2024-10-19 03:50:14,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:50:14,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 03:50:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:50:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 03:50:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2024-10-19 03:50:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:14,079 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:50:14,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-19 03:50:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:50:21,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-19 03:50:22,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2024-10-19 03:50:22,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:50:22,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash -837319659, now seen corresponding path program 1 times [2024-10-19 03:50:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:50:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484153994] [2024-10-19 03:50:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-19 03:50:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:50:22,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484153994] [2024-10-19 03:50:22,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484153994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:50:22,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317794486] [2024-10-19 03:50:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:22,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:50:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:50:22,518 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 03:50:22,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-19 03:50:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:22,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-19 03:50:22,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:50:22,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:50:22,963 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-19 03:50:22,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:23,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:23,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:23,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:23,119 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 19 treesize of output 11 [2024-10-19 03:50:23,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:50:23,184 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 19 treesize of output 11 [2024-10-19 03:50:23,245 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 19 treesize of output 11 [2024-10-19 03:50:23,264 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 19 treesize of output 11 [2024-10-19 03:50:23,314 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 19 treesize of output 11 [2024-10-19 03:50:23,338 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 19 treesize of output 11 [2024-10-19 03:50:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-19 03:50:23,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:50:23,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6848 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6848) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2024-10-19 03:50:23,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6848 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6848) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2024-10-19 03:50:23,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6845 (Array Int Int)) (v_ArrVal_6848 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6845) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6848) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2024-10-19 03:50:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-10-19 03:50:23,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317794486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:50:23,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:50:23,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2024-10-19 03:50:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788622916] [2024-10-19 03:50:23,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:50:23,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-19 03:50:23,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:50:23,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-19 03:50:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=146, Unknown=3, NotChecked=78, Total=272 [2024-10-19 03:50:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:23,722 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:50:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.647058823529411) internal successors, (181), 16 states have internal predecessors, (181), 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-19 03:50:23,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:50:23,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:50:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 03:50:53,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:50:53,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-19 03:50:53,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable150 [2024-10-19 03:50:53,218 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 03:50:53,219 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of4ForFork0 was SAFE (4/5) [2024-10-19 03:50:53,221 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:50:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:50:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:50:53,223 INFO L229 MonitoredProcess]: Starting monitored process 20 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-19 03:50:53,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-10-19 03:50:53,262 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:50:53,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:53,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 03:50:53,263 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:50:53,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 03:50:54,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:50:54,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1872129708, now seen corresponding path program 1 times [2024-10-19 03:50:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:50:54,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426296992] [2024-10-19 03:50:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-19 03:50:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:50:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426296992] [2024-10-19 03:50:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426296992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:50:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:50:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:50:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970765168] [2024-10-19 03:50:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:50:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 03:50:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:50:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:50:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:50:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:54,110 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:50:54,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 03:50:54,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-10-19 03:50:55,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:50:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1995789254, now seen corresponding path program 1 times [2024-10-19 03:50:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:50:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929747815] [2024-10-19 03:50:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-19 03:50:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:50:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929747815] [2024-10-19 03:50:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929747815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:50:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:50:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:50:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672748310] [2024-10-19 03:50:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:50:55,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 03:50:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:50:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:50:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:50:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:55,804 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:50:55,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-19 03:50:55,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:55,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:50:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-10-19 03:50:56,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:50:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1767011376, now seen corresponding path program 1 times [2024-10-19 03:50:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:50:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579684447] [2024-10-19 03:50:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:50:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 03:50:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:50:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579684447] [2024-10-19 03:50:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579684447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:50:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:50:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:50:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945990220] [2024-10-19 03:50:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:50:56,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 03:50:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:50:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:50:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:50:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:56,613 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:50:56,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-19 03:50:56,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:56,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:50:56,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:50:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:50:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:50:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-10-19 03:50:56,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 03:50:56,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash -153977489, now seen corresponding path program 1 times [2024-10-19 03:50:56,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:50:56,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269133940] [2024-10-19 03:50:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:50:56,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:50:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:56,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:50:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:50:57,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 03:50:57,000 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 03:50:57,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 03:50:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 03:50:57,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-10-19 03:50:57,002 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-19 03:50:57,002 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (5/5) [2024-10-19 03:50:57,002 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 03:50:57,002 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-19 03:50:57,025 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-19 03:50:57,027 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:50:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:50:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:50:57,031 INFO L229 MonitoredProcess]: Starting monitored process 21 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-19 03:50:57,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-10-19 03:50:57,072 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:50:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:50:57,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread3of5ForFork0 ======== [2024-10-19 03:50:57,073 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:50:57,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:50:59,001 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:50:59,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2562 treesize of output 2278 [2024-10-19 03:51:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1489072900, now seen corresponding path program 1 times [2024-10-19 03:51:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:01,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:51:01,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:51:04,712 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:51:04,713 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 1142 treesize of output 1046 [2024-10-19 03:51:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1084117562, now seen corresponding path program 1 times [2024-10-19 03:51:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:51:06,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:51:07,288 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:51:07,289 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-19 03:51:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1947928959, now seen corresponding path program 1 times [2024-10-19 03:51:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:09,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:51:09,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:51:12,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:51:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:51:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1890192743, now seen corresponding path program 1 times [2024-10-19 03:51:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:51:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913666604] [2024-10-19 03:51:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 03:51:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:51:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913666604] [2024-10-19 03:51:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913666604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:51:12,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:51:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:51:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099875627] [2024-10-19 03:51:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:51:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 03:51:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:51:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:51:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:51:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:51:12,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:51:12,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 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-19 03:51:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:51:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:51:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-10-19 03:51:13,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:51:13,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:51:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash 625059045, now seen corresponding path program 1 times [2024-10-19 03:51:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:51:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807965183] [2024-10-19 03:51:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-19 03:51:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:51:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807965183] [2024-10-19 03:51:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807965183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:51:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339482720] [2024-10-19 03:51:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:51:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:51:13,687 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 03:51:13,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-19 03:51:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:14,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-19 03:51:14,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:51:14,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:51:14,113 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-19 03:51:14,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:51:14,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:51:14,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:51:14,237 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 19 treesize of output 11 [2024-10-19 03:51:14,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:51:14,315 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 19 treesize of output 11 [2024-10-19 03:51:14,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:51:14,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 03:51:14,427 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 19 treesize of output 11 [2024-10-19 03:51:14,458 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 19 treesize of output 11 [2024-10-19 03:51:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-19 03:51:14,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:51:14,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7602 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7602) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:51:14,662 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7598 (Array Int Int)) (v_ArrVal_7602 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7598) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (- 1) (select .cse0 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7602) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:51:14,684 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7595 (Array Int Int)) (v_ArrVal_7598 (Array Int Int)) (v_ArrVal_7602 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7595) |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7598) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (- 1) (select .cse0 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7602) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 03:51:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 31 not checked. [2024-10-19 03:51:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339482720] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:51:14,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:51:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10] total 18 [2024-10-19 03:51:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604511841] [2024-10-19 03:51:14,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:51:14,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-19 03:51:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:51:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-19 03:51:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=188, Unknown=11, NotChecked=90, Total=342 [2024-10-19 03:51:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:51:14,769 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:51:14,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 18 states have internal predecessors, (170), 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-19 03:51:14,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:51:14,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:51:21,117 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 03:51:21,117 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 41 treesize of output 33 [2024-10-19 03:51:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash -769713142, now seen corresponding path program 1 times [2024-10-19 03:51:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:21,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:51:21,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-19 03:51:22,264 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 03:51:22,264 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 41 treesize of output 33 [2024-10-19 03:51:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1921971185, now seen corresponding path program 1 times [2024-10-19 03:51:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:51:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:51:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:51:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:51:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-19 03:51:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-19 03:54:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:54:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 03:54:17,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 03:54:17,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-19 03:54:17,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,SelfDestructingSolverStorable163,SelfDestructingSolverStorable164,SelfDestructingSolverStorable165,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2024-10-19 03:54:17,849 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-19 03:54:17,849 INFO L312 ceAbstractionStarter]: Result for error location t_funThread3of5ForFork0 was SAFE (1/6) [2024-10-19 03:54:17,852 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:54:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:54:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:54:17,854 INFO L229 MonitoredProcess]: Starting monitored process 23 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-19 03:54:17,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-10-19 03:54:17,895 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:54:17,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:54:17,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread2of5ForFork0 ======== [2024-10-19 03:54:17,896 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;@7e83bc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:54:17,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:54:20,020 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:54:20,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-19 03:54:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1489058659, now seen corresponding path program 1 times [2024-10-19 03:54:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:54:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:54:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:54:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:54:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:54:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:54:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:54:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:54:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 03:54:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 03:54:25,408 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:54:25,409 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-19 03:54:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1204699075, now seen corresponding path program 1 times [2024-10-19 03:54:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:54:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:54:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:54:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:54:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:54:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:54:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:54:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:54:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:54:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:54:28,694 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 03:54:28,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 1144 treesize of output 1046 [2024-10-19 03:54:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1674377233, now seen corresponding path program 1 times [2024-10-19 03:54:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:54:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:54:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:54:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:54:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:54:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:54:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:54:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:54:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:54:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:55:33,899 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 03:55:33,900 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 292 [2024-10-19 03:55:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2036794563, now seen corresponding path program 1 times [2024-10-19 03:55:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:55:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:55:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:55:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:55:34,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:55:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:55:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:55:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:55:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:55:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20