./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --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/pthread-complex/safestack_relacy.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 1d61eb304445c3cb39dfadfa4748d680ea5f0f4958f8bc176e8bc3c77c47e674 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --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 08:14:46,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 08:14:46,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 08:14:47,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 08:14:47,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 08:14:47,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 08:14:47,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 08:14:47,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 08:14:47,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 08:14:47,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 08:14:47,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 08:14:47,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 08:14:47,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 08:14:47,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 08:14:47,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 08:14:47,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 08:14:47,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 08:14:47,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 08:14:47,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 08:14:47,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 08:14:47,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 08:14:47,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 08:14:47,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 08:14:47,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 08:14:47,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 08:14:47,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 08:14:47,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 08:14:47,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 08:14:47,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 08:14:47,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 08:14:47,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:14:47,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 08:14:47,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 08:14:47,041 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 08:14:47,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 08:14:47,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 08:14:47,041 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 08:14:47,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 08:14:47,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 08:14:47,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 08:14:47,042 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 08:14:47,043 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 -> 1d61eb304445c3cb39dfadfa4748d680ea5f0f4958f8bc176e8bc3c77c47e674 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 -> LOOP 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 08:14:47,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 08:14:47,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 08:14:47,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 08:14:47,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 08:14:47,330 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 08:14:47,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2024-10-19 08:14:48,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 08:14:49,077 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 08:14:49,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2024-10-19 08:14:49,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7c40f74c/058a2e5281af4d219626c0ca3a70ddc6/FLAG394f03329 [2024-10-19 08:14:49,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7c40f74c/058a2e5281af4d219626c0ca3a70ddc6 [2024-10-19 08:14:49,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 08:14:49,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 08:14:49,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 08:14:49,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 08:14:49,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 08:14:49,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:14:49" (1/1) ... [2024-10-19 08:14:49,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1589e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:49, skipping insertion in model container [2024-10-19 08:14:49,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:14:49" (1/1) ... [2024-10-19 08:14:49,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 08:14:50,257 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i[78860,78873] [2024-10-19 08:14:50,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:14:50,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 08:14:50,363 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i[78860,78873] [2024-10-19 08:14:50,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:14:50,474 INFO L204 MainTranslator]: Completed translation [2024-10-19 08:14:50,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50 WrapperNode [2024-10-19 08:14:50,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 08:14:50,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 08:14:50,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 08:14:50,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 08:14:50,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,566 INFO L138 Inliner]: procedures = 481, calls = 74, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 286 [2024-10-19 08:14:50,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 08:14:50,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 08:14:50,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 08:14:50,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 08:14:50,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 08:14:50,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 08:14:50,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 08:14:50,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 08:14:50,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (1/1) ... [2024-10-19 08:14:50,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:14:50,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:14:50,664 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 08:14:50,665 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 08:14:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 08:14:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 08:14:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 08:14:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 08:14:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 08:14:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-19 08:14:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-19 08:14:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 08:14:50,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 08:14:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 08:14:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 08:14:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 08:14:50,715 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 08:14:50,979 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 08:14:50,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 08:14:51,381 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 08:14:51,382 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 08:14:51,618 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 08:14:51,618 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-19 08:14:51,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:14:51 BoogieIcfgContainer [2024-10-19 08:14:51,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 08:14:51,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 08:14:51,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 08:14:51,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 08:14:51,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 08:14:49" (1/3) ... [2024-10-19 08:14:51,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9a3942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:14:51, skipping insertion in model container [2024-10-19 08:14:51,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:14:50" (2/3) ... [2024-10-19 08:14:51,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9a3942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:14:51, skipping insertion in model container [2024-10-19 08:14:51,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:14:51" (3/3) ... [2024-10-19 08:14:51,629 INFO L112 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2024-10-19 08:14:51,647 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 08:14:51,647 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 08:14:51,647 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 08:14:51,721 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-19 08:14:51,810 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:14:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:14:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:14:51,813 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 08:14:51,815 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 08:14:51,954 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:14:51,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:14:51,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-10-19 08:14:51,988 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;@2c1dfc35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:14:51,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:14:52,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:14:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:14:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1591342499, now seen corresponding path program 1 times [2024-10-19 08:14:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:14:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761132979] [2024-10-19 08:14:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:14:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:14:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761132979] [2024-10-19 08:14:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761132979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:14:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:14:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:14:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206159940] [2024-10-19 08:14:52,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:14:52,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:14:52,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:14:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:14:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:14:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:52,851 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:14:52,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:14:52,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:14:52,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 08:14:52,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:14:52,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:14:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash 518882470, now seen corresponding path program 1 times [2024-10-19 08:14:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:14:52,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250938738] [2024-10-19 08:14:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 08:14:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:14:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250938738] [2024-10-19 08:14:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250938738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:14:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:14:53,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 08:14:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513939546] [2024-10-19 08:14:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:14:53,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:14:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:14:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:14:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:14:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:53,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:14:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 08:14:53,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:14:53,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:14:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:14:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-19 08:14:53,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:14:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:14:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash -663885342, now seen corresponding path program 1 times [2024-10-19 08:14:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:14:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948761322] [2024-10-19 08:14:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 08:14:53,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:14:53,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948761322] [2024-10-19 08:14:53,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948761322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:14:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043024991] [2024-10-19 08:14:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:14:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:14:53,466 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 08:14:53,468 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 08:14:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:53,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-19 08:14:53,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:14:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:14:53,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:14:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:14:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043024991] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:14:53,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:14:53,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-10-19 08:14:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936331880] [2024-10-19 08:14:53,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:14:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-19 08:14:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:14:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 08:14:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-19 08:14:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:53,770 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:14:53,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 08:14:53,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:14:53,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:14:53,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:14:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:14:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 08:14:54,032 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 08:14:54,210 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,SelfDestructingSolverStorable2 [2024-10-19 08:14:54,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:14:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:14:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1717741574, now seen corresponding path program 1 times [2024-10-19 08:14:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:14:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174498778] [2024-10-19 08:14:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:14:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:14:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174498778] [2024-10-19 08:14:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174498778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:14:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:14:54,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:14:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066703268] [2024-10-19 08:14:54,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:14:54,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 08:14:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:14:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:14:54,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:14:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:54,369 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:14:54,369 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 08:14:54,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:14:54,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:14:54,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-19 08:14:54,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:14:56,995 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 35 treesize of output 27 [2024-10-19 08:14:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 216495628, now seen corresponding path program 1 times [2024-10-19 08:14:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:14:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:14:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:14:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:14:57,483 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 123 treesize of output 105 [2024-10-19 08:14:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash -728482990, now seen corresponding path program 1 times [2024-10-19 08:14:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:14:57,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:14:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:14:58,075 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 123 treesize of output 105 [2024-10-19 08:14:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1108140637, now seen corresponding path program 1 times [2024-10-19 08:14:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:58,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:14:58,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:14:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:14:58,817 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 123 treesize of output 105 [2024-10-19 08:14:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1761743767, now seen corresponding path program 1 times [2024-10-19 08:14:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:14:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:14:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:14:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:14:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:15:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:15:00,777 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 08:15:00,788 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 820 treesize of output 772 [2024-10-19 08:15:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash 7374210, now seen corresponding path program 1 times [2024-10-19 08:15:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:02,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:04,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-10-19 08:15:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1503470680, now seen corresponding path program 1 times [2024-10-19 08:15:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:04,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:04,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:05,126 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:15:05,127 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 118 treesize of output 101 [2024-10-19 08:15:05,185 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:15:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 926 treesize of output 870 [2024-10-19 08:15:05,233 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:15:05,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1375 treesize of output 1 [2024-10-19 08:15:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 637044380, now seen corresponding path program 1 times [2024-10-19 08:15:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:13,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:13,566 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 08:15:13,587 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:15:13,588 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 1344 treesize of output 1 [2024-10-19 08:15:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1276208172, now seen corresponding path program 1 times [2024-10-19 08:15:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:15:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:15:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:15:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:15:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:15:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-19 08:15:16,735 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 820 treesize of output 772 [2024-10-19 08:15:16,762 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 08:15:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 7374252, now seen corresponding path program 1 times [2024-10-19 08:15:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:17,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:18,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-10-19 08:15:18,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:15:18,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:15:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1503470644, now seen corresponding path program 1 times [2024-10-19 08:15:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:18,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:19,499 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:15:19,500 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 118 treesize of output 101 [2024-10-19 08:15:19,553 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:15:19,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 890 treesize of output 834 [2024-10-19 08:15:19,610 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:15:19,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2696 treesize of output 1 [2024-10-19 08:15:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash 637044414, now seen corresponding path program 1 times [2024-10-19 08:15:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:28,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1748717806, now seen corresponding path program 1 times [2024-10-19 08:15:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:29,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:30,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-19 08:15:30,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 183 [2024-10-19 08:15:30,323 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:15:30,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2024-10-19 08:15:30,335 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:15:30,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 1 [2024-10-19 08:15:30,355 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:15:30,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 196 [2024-10-19 08:15:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1185825061, now seen corresponding path program 1 times [2024-10-19 08:15:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:30,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:31,253 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 08:15:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1894121626, now seen corresponding path program 1 times [2024-10-19 08:15:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:31,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:31,811 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 369 treesize of output 345 [2024-10-19 08:15:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1411778969, now seen corresponding path program 1 times [2024-10-19 08:15:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:34,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:34,778 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:15:34,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2538 treesize of output 2222 [2024-10-19 08:15:34,927 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:15:34,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 118 treesize of output 1 [2024-10-19 08:15:34,986 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:15:34,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 926 treesize of output 870 [2024-10-19 08:15:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash 489841104, now seen corresponding path program 1 times [2024-10-19 08:15:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:42,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:42,639 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:15:42,640 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 1340 treesize of output 1200 [2024-10-19 08:15:42,711 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 08:15:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1999869433, now seen corresponding path program 1 times [2024-10-19 08:15:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:15:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:15:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:43,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:15:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:15:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:15:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-19 08:15:43,933 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 08:15: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 748 treesize of output 700 [2024-10-19 08:15:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash 7374337, now seen corresponding path program 1 times [2024-10-19 08:15:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:44,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:44,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-10-19 08:15:45,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:15:45,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:15:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1503470561, now seen corresponding path program 1 times [2024-10-19 08:15:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:45,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:45,576 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2024-10-19 08:15:45,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 890 treesize of output 841 [2024-10-19 08:15:45,627 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:15:45,628 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 118 treesize of output 101 [2024-10-19 08:15:45,689 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:15:45,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1378 treesize of output 1 [2024-10-19 08:15:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 637044495, now seen corresponding path program 1 times [2024-10-19 08:15:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:57,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1748717731, now seen corresponding path program 1 times [2024-10-19 08:15:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:58,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:58,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-19 08:15:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 181 [2024-10-19 08:15:58,688 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:15:58,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2024-10-19 08:15:58,700 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:15:58,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 1 [2024-10-19 08:15:58,719 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:15:58,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 191 [2024-10-19 08:15:59,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:15:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1185824996, now seen corresponding path program 1 times [2024-10-19 08:15:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:59,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:59,473 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 08:15:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1894121687, now seen corresponding path program 1 times [2024-10-19 08:15:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:15:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:15:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:59,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:15:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:15:59,824 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 820 treesize of output 772 [2024-10-19 08:16:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1411778914, now seen corresponding path program 1 times [2024-10-19 08:16:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:00,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:00,539 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:16:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1331 treesize of output 1167 [2024-10-19 08:16:00,709 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:16:00,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 499 treesize of output 467 [2024-10-19 08:16:00,814 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:16:00,815 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 118 treesize of output 1 [2024-10-19 08:16:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 489841149, now seen corresponding path program 1 times [2024-10-19 08:16:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:11,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:11,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:12,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 08:16:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1449984903, now seen corresponding path program 1 times [2024-10-19 08:16:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:12,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:16:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:16:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:16:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:16:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 08:16:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2024-10-19 08:16:15,337 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 369 treesize of output 345 [2024-10-19 08:16:15,371 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 08:16:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 7374384, now seen corresponding path program 1 times [2024-10-19 08:16:15,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:15,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:16,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-10-19 08:16:16,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:16:16,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:16:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1503470514, now seen corresponding path program 1 times [2024-10-19 08:16:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:16,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:16,989 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:16:16,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1382 treesize of output 1226 [2024-10-19 08:16:17,123 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:16:17,124 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 118 treesize of output 1 [2024-10-19 08:16:17,153 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:16:17,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 475 treesize of output 443 [2024-10-19 08:16:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash 637044544, now seen corresponding path program 1 times [2024-10-19 08:16:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:29,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1748717684, now seen corresponding path program 1 times [2024-10-19 08:16:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:30,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:31,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-19 08:16:31,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 183 [2024-10-19 08:16:31,171 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:16:31,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 1 [2024-10-19 08:16:31,192 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:16:31,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 196 [2024-10-19 08:16:31,308 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:16:31,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2024-10-19 08:16:31,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:16:31,615 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-19 08:16:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1185824947, now seen corresponding path program 1 times [2024-10-19 08:16:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:31,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:32,030 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 08:16:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1894121738, now seen corresponding path program 1 times [2024-10-19 08:16:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:32,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:32,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:32,570 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 393 treesize of output 369 [2024-10-19 08:16:34,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1411778861, now seen corresponding path program 1 times [2024-10-19 08:16:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:34,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:35,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:35,424 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:16:35,424 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 118 treesize of output 101 [2024-10-19 08:16:35,479 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:16:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1644 treesize of output 1540 [2024-10-19 08:16:35,532 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:16:35,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1442 treesize of output 1 [2024-10-19 08:16:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 489841204, now seen corresponding path program 1 times [2024-10-19 08:16:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:44,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:45,181 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 820 treesize of output 772 [2024-10-19 08:16:45,200 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 08:16:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1858443807, now seen corresponding path program 1 times [2024-10-19 08:16:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:47,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:48,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-10-19 08:16:48,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:16:48,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:16:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash 741533503, now seen corresponding path program 1 times [2024-10-19 08:16:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:16:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:16:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:48,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:16:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:16:49,061 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:16:49,061 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 118 treesize of output 101 [2024-10-19 08:16:49,144 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:16:49,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1684 treesize of output 1580 [2024-10-19 08:16:49,205 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:16:49,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 747 treesize of output 1 [2024-10-19 08:17:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1512690953, now seen corresponding path program 1 times [2024-10-19 08:17:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:00,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -368359557, now seen corresponding path program 1 times [2024-10-19 08:17:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:01,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:02,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-19 08:17:02,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 183 [2024-10-19 08:17:02,163 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:17:02,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2024-10-19 08:17:02,183 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:17:02,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 195 [2024-10-19 08:17:02,269 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:17:02,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 1 [2024-10-19 08:17:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1806601606, now seen corresponding path program 1 times [2024-10-19 08:17:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:02,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:03,135 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 08:17:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash -170086769, now seen corresponding path program 1 times [2024-10-19 08:17:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:03,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:03,897 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 1538 treesize of output 1442 [2024-10-19 08:17:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash -977734338, now seen corresponding path program 1 times [2024-10-19 08:17:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:06,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:06,975 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2024-10-19 08:17:06,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 854 treesize of output 805 [2024-10-19 08:17:07,063 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:17:07,064 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 118 treesize of output 101 [2024-10-19 08:17:07,127 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:17:07,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1323 treesize of output 1 [2024-10-19 08:17:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 994761695, now seen corresponding path program 1 times [2024-10-19 08:17:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:18,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:18,890 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 752 treesize of output 704 [2024-10-19 08:17:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1959367209, now seen corresponding path program 1 times [2024-10-19 08:17:19,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-19 08:17:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-19 08:17:22,330 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 393 treesize of output 369 [2024-10-19 08:17:22,384 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 08:17:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1093465594, now seen corresponding path program 1 times [2024-10-19 08:17:22,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:17:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:24,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:17:26,383 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 08:17:26,399 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 820 treesize of output 772 [2024-10-19 08:17:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1768263215, now seen corresponding path program 1 times [2024-10-19 08:17:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:17:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:17:36,704 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 369 treesize of output 345 [2024-10-19 08:17:36,748 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 08:17:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2091816577, now seen corresponding path program 1 times [2024-10-19 08:17:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:39,891 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 08:17:39,903 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 369 treesize of output 345 [2024-10-19 08:17:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1276207874, now seen corresponding path program 1 times [2024-10-19 08:17:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:17:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:17:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:17:47,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:17:47,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-19 08:17:47,363 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] [2024-10-19 08:17:47,364 INFO L312 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-10-19 08:17:47,367 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:17:47,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:17:47,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:17:47,370 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 08:17:47,371 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 08:17:47,428 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:17:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:47,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 08:17:47,431 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;@2c1dfc35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:17:47,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:17:47,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:17:47,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash 76106038, now seen corresponding path program 1 times [2024-10-19 08:17:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:17:47,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241027530] [2024-10-19 08:17:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:17:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:17:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241027530] [2024-10-19 08:17:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241027530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:17:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:17:47,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:17:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717406329] [2024-10-19 08:17:47,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:17:47,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:17:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:17:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:17:47,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:17:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:47,579 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:17:47,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 08:17:47,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:17:47,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-19 08:17:47,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:17:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -387267669, now seen corresponding path program 1 times [2024-10-19 08:17:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:17:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890223742] [2024-10-19 08:17:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:47,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:17:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:17:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890223742] [2024-10-19 08:17:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890223742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:17:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942724995] [2024-10-19 08:17:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:47,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:17:47,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:17:47,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:17:47,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-19 08:17:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:47,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-19 08:17:47,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:17:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:17:47,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:17:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:17:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942724995] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:17:48,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:17:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-19 08:17:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003209108] [2024-10-19 08:17:48,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:17:48,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-19 08:17:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:17:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 08:17:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-19 08:17:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:48,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:17:48,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 08:17:48,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:17:48,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:17:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:48,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-19 08:17:48,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:17:48,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:17:48,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -728483562, now seen corresponding path program 2 times [2024-10-19 08:17:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:17:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761397496] [2024-10-19 08:17:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:48,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:17:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:17:48,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 08:17:48,343 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 08:17:48,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-19 08:17:48,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-19 08:17:48,345 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-19 08:17:48,346 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-19 08:17:48,347 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 08:17:48,347 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-19 08:17:48,384 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 08:17:48,387 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:17:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:17:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:17:48,388 INFO L229 MonitoredProcess]: Starting monitored process 6 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 08:17:48,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-19 08:17:48,455 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:17:48,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:48,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-10-19 08:17:48,458 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;@2c1dfc35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:17:48,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:17:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 715611081, now seen corresponding path program 1 times [2024-10-19 08:17:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:49,248 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 08:17:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:49,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 08:17:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:17:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:17:49,548 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 123 treesize of output 105 [2024-10-19 08:17:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1978170329, now seen corresponding path program 1 times [2024-10-19 08:17:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:50,058 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 123 treesize of output 105 [2024-10-19 08:17:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1193738698, now seen corresponding path program 1 times [2024-10-19 08:17:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:50,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:17:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -957059485, now seen corresponding path program 1 times [2024-10-19 08:17:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:17:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182073928] [2024-10-19 08:17:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-19 08:17:50,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:17:50,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182073928] [2024-10-19 08:17:50,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182073928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:17:50,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:17:50,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 08:17:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396968592] [2024-10-19 08:17:50,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:17:50,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:17:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:17:50,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:17:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:17:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:50,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:17:50,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 08:17:50,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:50,809 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 123 treesize of output 105 [2024-10-19 08:17:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1978170315, now seen corresponding path program 1 times [2024-10-19 08:17:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:50,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:51,166 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 123 treesize of output 105 [2024-10-19 08:17:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1193738686, now seen corresponding path program 1 times [2024-10-19 08:17:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:51,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74 [2024-10-19 08:17:51,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:17:51,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash 278268279, now seen corresponding path program 1 times [2024-10-19 08:17:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:17:51,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137341004] [2024-10-19 08:17:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-19 08:17:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:17:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137341004] [2024-10-19 08:17:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137341004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:17:51,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:17:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 08:17:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73507616] [2024-10-19 08:17:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:17:51,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:17:51,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:17:51,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:17:51,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:17:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:51,820 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:17:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:17:51,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:51,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:52,079 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 123 treesize of output 105 [2024-10-19 08:17:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1978170301, now seen corresponding path program 1 times [2024-10-19 08:17:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:17:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:52,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77 [2024-10-19 08:17:52,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:17:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:17:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1937363984, now seen corresponding path program 1 times [2024-10-19 08:17:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:17:52,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302461897] [2024-10-19 08:17:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-19 08:17:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:17:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302461897] [2024-10-19 08:17:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302461897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:17:52,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:17:52,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:17:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744089387] [2024-10-19 08:17:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:17:52,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 08:17:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:17:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:17:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:17:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:52,940 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:17:52,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 08:17:52,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:52,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:17:52,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:17:54,263 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 99 treesize of output 81 [2024-10-19 08:17:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1803455963, now seen corresponding path program 1 times [2024-10-19 08:17:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-19 08:17:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-19 08:17:56,989 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 99 treesize of output 81 [2024-10-19 08:17:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash -177697098, now seen corresponding path program 1 times [2024-10-19 08:17:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-19 08:17:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:17:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:17:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:17:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-19 08:17:57,662 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-10-19 08:17:57,662 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 111 treesize of output 90 [2024-10-19 08:17:57,717 INFO L349 Elim1Store]: treesize reduction 34, result has 10.5 percent of original size [2024-10-19 08:17:57,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 89 [2024-10-19 08:18:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1031681175, now seen corresponding path program 1 times [2024-10-19 08:18:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-19 08:18:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-19 08:18:05,558 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 08:18:05,558 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 116 treesize of output 90 [2024-10-19 08:18:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash 772592072, now seen corresponding path program 1 times [2024-10-19 08:18:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-19 08:18:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-19 08:18:06,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:18:06,708 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:18:06,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2024-10-19 08:18:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1145794972, now seen corresponding path program 1 times [2024-10-19 08:18:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:07,352 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:18:07,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 381 treesize of output 353 [2024-10-19 08:18:07,422 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:18:07,423 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 115 treesize of output 91 [2024-10-19 08:18:07,486 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:18:07,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1287 treesize of output 1 [2024-10-19 08:18:07,507 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:18:07,507 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 118 treesize of output 1 [2024-10-19 08:18:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1887768115, now seen corresponding path program 1 times [2024-10-19 08:18:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:19,222 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-19 08:18:19,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 47 [2024-10-19 08:18:19,316 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-19 08:18:19,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 56 [2024-10-19 08:18:19,540 INFO L349 Elim1Store]: treesize reduction 57, result has 50.9 percent of original size [2024-10-19 08:18:19,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 167 treesize of output 163 [2024-10-19 08:18:20,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:20,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:20,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:20,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:21,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:21,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:21,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:21,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:25,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:25,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:25,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:25,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:29,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:29,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:29,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:29,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:18:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1669099060, now seen corresponding path program 1 times [2024-10-19 08:18:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:32,298 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-19 08:18:32,299 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 27 treesize of output 26 [2024-10-19 08:18:32,344 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:18:32,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 27 [2024-10-19 08:18:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -202467445, now seen corresponding path program 1 times [2024-10-19 08:18:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:37,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:37,863 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:18:37,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-10-19 08:18:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1578691246, now seen corresponding path program 1 times [2024-10-19 08:18:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:37,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:38,659 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 08:18:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2038516659, now seen corresponding path program 1 times [2024-10-19 08:18:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-10-19 08:18:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -266921113, now seen corresponding path program 1 times [2024-10-19 08:18:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:40,193 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:18:40,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 27 [2024-10-19 08:18:40,211 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:18:40,211 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 27 treesize of output 19 [2024-10-19 08:18:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1186699718, now seen corresponding path program 1 times [2024-10-19 08:18:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:45,328 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:18:45,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-10-19 08:18:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash -537688071, now seen corresponding path program 1 times [2024-10-19 08:18:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-19 08:18:46,063 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 99 treesize of output 81 [2024-10-19 08:18:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2023459143, now seen corresponding path program 1 times [2024-10-19 08:18:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-19 08:18:46,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-19 08:18:46,632 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 99 treesize of output 81 [2024-10-19 08:18:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1999812462, now seen corresponding path program 1 times [2024-10-19 08:18:46,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-19 08:18:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:18:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:18:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:18:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-19 08:18:47,317 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-19 08:18:47,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 77 [2024-10-19 08:19:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash 916395091, now seen corresponding path program 1 times [2024-10-19 08:19:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-19 08:19:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-19 08:19:01,756 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 08:19:01,756 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 115 treesize of output 89 [2024-10-19 08:19:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1509093417, now seen corresponding path program 1 times [2024-10-19 08:19:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-19 08:19:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-19 08:19:02,246 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 49 treesize of output 31 [2024-10-19 08:19:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 138354842, now seen corresponding path program 1 times [2024-10-19 08:19:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-19 08:19:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-19 08:19:03,323 INFO L349 Elim1Store]: treesize reduction 34, result has 10.5 percent of original size [2024-10-19 08:19:03,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 89 [2024-10-19 08:19:03,376 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-10-19 08:19:03,377 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 111 treesize of output 90 [2024-10-19 08:19:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash -185198119, now seen corresponding path program 1 times [2024-10-19 08:19:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-19 08:19:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-19 08:19:10,728 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 08:19:10,728 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 116 treesize of output 90 [2024-10-19 08:19:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash -366520888, now seen corresponding path program 1 times [2024-10-19 08:19:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:10,988 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-19 08:19:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-19 08:19:11,272 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 99 treesize of output 81 [2024-10-19 08:19:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash -965852290, now seen corresponding path program 1 times [2024-10-19 08:19:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-19 08:19:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-19 08:19:12,279 INFO L349 Elim1Store]: treesize reduction 34, result has 10.5 percent of original size [2024-10-19 08:19:12,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 89 [2024-10-19 08:19:12,319 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-10-19 08:19:12,319 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 111 treesize of output 90 [2024-10-19 08:19:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -471293925, now seen corresponding path program 1 times [2024-10-19 08:19:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-19 08:19:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:19,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-19 08:19:20,046 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 08:19:20,046 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 116 treesize of output 90 [2024-10-19 08:19:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1983158984, now seen corresponding path program 1 times [2024-10-19 08:19:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-19 08:19:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-19 08:19:21,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:19:21,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:19:21,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-19 08:19:21,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2024-10-19 08:19:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2052470392, now seen corresponding path program 1 times [2024-10-19 08:19:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-19 08:19:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-19 08:19:22,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2024-10-19 08:19:22,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-19 08:19:22,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:19:22,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2022578456, now seen corresponding path program 1 times [2024-10-19 08:19:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-19 08:19:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-19 08:19:24,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:19:24,153 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:19:24,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 288 [2024-10-19 08:19:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash -749454450, now seen corresponding path program 1 times [2024-10-19 08:19:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:25,312 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:19:25,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1427 treesize of output 1263 [2024-10-19 08:19:25,451 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:19:25,451 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 118 treesize of output 1 [2024-10-19 08:19:25,500 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-19 08:19:25,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 854 treesize of output 798 [2024-10-19 08:19:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1168132749, now seen corresponding path program 1 times [2024-10-19 08:19:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:38,328 INFO L349 Elim1Store]: treesize reduction 57, result has 50.9 percent of original size [2024-10-19 08:19:38,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 163 [2024-10-19 08:19:38,687 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-10-19 08:19:38,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 45 [2024-10-19 08:19:38,762 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-10-19 08:19:38,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 44 [2024-10-19 08:19:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,254 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-19 08:19:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:39,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:43,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:43,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:43,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:43,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:46,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:46,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:46,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:46,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:19:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1588847662, now seen corresponding path program 1 times [2024-10-19 08:19:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:50,645 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:19:50,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 27 [2024-10-19 08:19:50,664 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:19:50,664 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 27 treesize of output 19 [2024-10-19 08:19:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2009629306, now seen corresponding path program 1 times [2024-10-19 08:19:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:54,321 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:19:54,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-10-19 08:19:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1311246366, now seen corresponding path program 1 times [2024-10-19 08:19:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:55,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 08:19:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1628733247, now seen corresponding path program 1 times [2024-10-19 08:19:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-19 08:19:56,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-10-19 08:19:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1435622071, now seen corresponding path program 1 times [2024-10-19 08:19:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-19 08:19:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:19:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:19:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:19:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-19 08:19:57,600 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:19:57,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 27 [2024-10-19 08:19:57,618 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:19:57,619 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 27 treesize of output 19 [2024-10-19 08:20:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash -948578998, now seen corresponding path program 1 times [2024-10-19 08:20:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-19 08:20:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:02,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-19 08:20:03,162 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:20:03,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-10-19 08:20:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1287885127, now seen corresponding path program 1 times [2024-10-19 08:20:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-19 08:20:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-19 08:20:04,175 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 99 treesize of output 81 [2024-10-19 08:20:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1730151119, now seen corresponding path program 1 times [2024-10-19 08:20:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-19 08:20:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-19 08:20:05,154 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-10-19 08:20:05,155 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 111 treesize of output 90 [2024-10-19 08:20:05,209 INFO L349 Elim1Store]: treesize reduction 34, result has 10.5 percent of original size [2024-10-19 08:20:05,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 89 [2024-10-19 08:20:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 961528763, now seen corresponding path program 1 times [2024-10-19 08:20:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-19 08:20:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-19 08:20:14,175 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-19 08:20:14,176 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 55 treesize of output 37 [2024-10-19 08:20:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1757845450, now seen corresponding path program 1 times [2024-10-19 08:20:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:14,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-19 08:20:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-19 08:20:15,546 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:20:15,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2024-10-19 08:20:15,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:20:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 669813520, now seen corresponding path program 1 times [2024-10-19 08:20:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-10-19 08:20:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-10-19 08:20:17,201 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-10-19 08:20:17,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2024-10-19 08:20:17,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:20:17,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2024-10-19 08:20:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1896345753, now seen corresponding path program 1 times [2024-10-19 08:20:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-19 08:20:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-19 08:20:18,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:20:18,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 400 [2024-10-19 08:20:19,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-19 08:20:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash -119572811, now seen corresponding path program 1 times [2024-10-19 08:20:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-19 08:20:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-19 08:20:20,031 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-10-19 08:20:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1550 treesize of output 1450 [2024-10-19 08:20:20,069 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:20:20,070 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 115 treesize of output 91 [2024-10-19 08:20:20,118 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-19 08:20:20,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1287 treesize of output 1 [2024-10-19 08:20:20,152 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-19 08:20:20,153 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 118 treesize of output 1 [2024-10-19 08:20:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash -388034792, now seen corresponding path program 1 times [2024-10-19 08:20:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-10-19 08:20:32,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-10-19 08:20:33,545 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-19 08:20:33,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 47 [2024-10-19 08:20:33,644 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-19 08:20:33,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 56 [2024-10-19 08:20:33,877 INFO L349 Elim1Store]: treesize reduction 57, result has 50.9 percent of original size [2024-10-19 08:20:33,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 167 treesize of output 163 [2024-10-19 08:20:35,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:35,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,964 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-19 08:20:36,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:36,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:37,015 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-19 08:20:37,018 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-19 08:20:38,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:38,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:38,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:38,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-19 08:20:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash 760437141, now seen corresponding path program 1 times [2024-10-19 08:20:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:41,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable153,SelfDestructingSolverStorable110,SelfDestructingSolverStorable154,SelfDestructingSolverStorable150,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable104,SelfDestructingSolverStorable148,SelfDestructingSolverStorable105,SelfDestructingSolverStorable149,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable144,SelfDestructingSolverStorable101,SelfDestructingSolverStorable145,SelfDestructingSolverStorable102,SelfDestructingSolverStorable146,SelfDestructingSolverStorable103,SelfDestructingSolverStorable147,SelfDestructingSolverStorable140,SelfDestructingSolverStorable80,SelfDestructingSolverStorable141,SelfDestructingSolverStorable81,SelfDestructingSolverStorable142,SelfDestructingSolverStorable82,SelfDestructingSolverStorable143,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable137,SelfDestructingSolverStorable88,SelfDestructingSolverStorable138,SelfDestructingSolverStorable89,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable131,SelfDestructingSolverStorable93,SelfDestructingSolverStorable132,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable159,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable155,SelfDestructingSolverStorable112,SelfDestructingSolverStorable156,SelfDestructingSolverStorable113,SelfDestructingSolverStorable157,SelfDestructingSolverStorable114,SelfDestructingSolverStorable158 [2024-10-19 08:20:41,392 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms at de.uni_freiburg.informatik.ultimate.logic.NoopScript.annotate(NoopScript.java:471) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 40 more [2024-10-19 08:20:41,399 INFO L158 Benchmark]: Toolchain (without parser) took 352026.19ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 87.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 474.7MB. Max. memory is 16.1GB. [2024-10-19 08:20:41,399 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 08:20:41,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1101.29ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 74.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-19 08:20:41,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.50ms. Allocated memory is still 159.4MB. Free memory was 74.5MB in the beginning and 70.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-19 08:20:41,399 INFO L158 Benchmark]: Boogie Preprocessor took 49.68ms. Allocated memory is still 159.4MB. Free memory was 70.5MB in the beginning and 66.8MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 08:20:41,399 INFO L158 Benchmark]: RCFGBuilder took 997.51ms. Allocated memory is still 159.4MB. Free memory was 66.8MB in the beginning and 67.6MB in the end (delta: -737.5kB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-10-19 08:20:41,400 INFO L158 Benchmark]: TraceAbstraction took 349776.44ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 66.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 451.7MB. Max. memory is 16.1GB. [2024-10-19 08:20:41,400 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1101.29ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 74.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.50ms. Allocated memory is still 159.4MB. Free memory was 74.5MB in the beginning and 70.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.68ms. Allocated memory is still 159.4MB. Free memory was 70.5MB in the beginning and 66.8MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.51ms. Allocated memory is still 159.4MB. Free memory was 66.8MB in the beginning and 67.6MB in the end (delta: -737.5kB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 349776.44ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 66.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 451.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3124, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 678, dependent conditional: 604, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2623, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 177, dependent conditional: 103, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2623, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 177, dependent conditional: 103, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2623, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 177, dependent conditional: 103, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 548, dependent conditional: 400, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, independent: 551, independent conditional: 59, independent unconditional: 492, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, independent: 508, independent conditional: 0, independent unconditional: 508, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11210, independent: 1958, independent conditional: 1390, independent unconditional: 568, dependent: 9252, dependent conditional: 6028, dependent unconditional: 3225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2994, independent: 1895, independent conditional: 450, independent unconditional: 1445, dependent: 388, dependent conditional: 171, dependent unconditional: 217, unknown: 711, unknown conditional: 145, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 551, Positive conditional cache size: 59, Positive unconditional cache size: 492, Negative cache size: 160, Negative conditional cache size: 86, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1410, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 548, dependent conditional: 400, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, independent: 551, independent conditional: 59, independent unconditional: 492, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, independent: 508, independent conditional: 0, independent unconditional: 508, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11210, independent: 1958, independent conditional: 1390, independent unconditional: 568, dependent: 9252, dependent conditional: 6028, dependent unconditional: 3225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2994, independent: 1895, independent conditional: 450, independent unconditional: 1445, dependent: 388, dependent conditional: 171, dependent unconditional: 217, unknown: 711, unknown conditional: 145, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 551, Positive conditional cache size: 59, Positive unconditional cache size: 492, Negative cache size: 160, Negative conditional cache size: 86, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1410 ], Independence queries for same thread: 501, Persistent sets #1 benchmarks: Persistent set computation time: 3.9s, Number of persistent set computation: 209, Number of trivial persistent sets: 207, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 654, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3124, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 678, dependent conditional: 604, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2623, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 177, dependent conditional: 103, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2623, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 177, dependent conditional: 103, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2623, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 177, dependent conditional: 103, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 548, dependent conditional: 400, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, independent: 551, independent conditional: 59, independent unconditional: 492, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, independent: 508, independent conditional: 0, independent unconditional: 508, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11210, independent: 1958, independent conditional: 1390, independent unconditional: 568, dependent: 9252, dependent conditional: 6028, dependent unconditional: 3225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2994, independent: 1895, independent conditional: 450, independent unconditional: 1445, dependent: 388, dependent conditional: 171, dependent unconditional: 217, unknown: 711, unknown conditional: 145, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 551, Positive conditional cache size: 59, Positive unconditional cache size: 492, Negative cache size: 160, Negative conditional cache size: 86, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1410, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 1776, independent unconditional: 670, dependent: 548, dependent conditional: 400, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2994, independent: 2446, independent conditional: 509, independent unconditional: 1937, dependent: 548, dependent conditional: 257, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, independent: 551, independent conditional: 59, independent unconditional: 492, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, independent: 508, independent conditional: 0, independent unconditional: 508, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 160, dependent conditional: 86, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11210, independent: 1958, independent conditional: 1390, independent unconditional: 568, dependent: 9252, dependent conditional: 6028, dependent unconditional: 3225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2994, independent: 1895, independent conditional: 450, independent unconditional: 1445, dependent: 388, dependent conditional: 171, dependent unconditional: 217, unknown: 711, unknown conditional: 145, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 551, Positive conditional cache size: 59, Positive unconditional cache size: 492, Negative cache size: 160, Negative conditional cache size: 86, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1410 ], Independence queries for same thread: 501 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 182, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 170, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 113, unknown conditional: 0, unknown unconditional: 113] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 170, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 113, unknown conditional: 0, unknown unconditional: 113] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23 ], Independence queries for same thread: 15, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 182, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 170, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 113, unknown conditional: 0, unknown unconditional: 113] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 23, independent unconditional: 141, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 170, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 113, unknown conditional: 0, unknown unconditional: 113] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23 ], Independence queries for same thread: 15 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-19 08:20:41,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-10-19 08:20:41,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-10-19 08:20:41,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-19 08:20:42,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.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 1d61eb304445c3cb39dfadfa4748d680ea5f0f4958f8bc176e8bc3c77c47e674 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --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 08:20:44,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 08:20:44,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-19 08:20:44,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 08:20:44,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 08:20:44,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 08:20:44,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 08:20:44,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 08:20:44,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 08:20:44,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 08:20:44,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 08:20:44,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 08:20:44,502 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 08:20:44,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 08:20:44,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 08:20:44,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 08:20:44,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 08:20:44,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 08:20:44,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 08:20:44,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 08:20:44,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 08:20:44,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-19 08:20:44,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 08:20:44,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-19 08:20:44,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 08:20:44,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 08:20:44,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 08:20:44,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 08:20:44,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 08:20:44,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 08:20:44,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 08:20:44,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:20:44,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 08:20:44,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 08:20:44,513 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 08:20:44,513 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-19 08:20:44,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 08:20:44,513 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 08:20:44,514 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-19 08:20:44,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 08:20:44,514 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-19 08:20:44,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 08:20:44,515 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 08:20:44,515 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 -> 1d61eb304445c3cb39dfadfa4748d680ea5f0f4958f8bc176e8bc3c77c47e674 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 -> LOOP 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 08:20:44,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 08:20:44,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 08:20:44,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 08:20:44,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 08:20:44,888 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 08:20:44,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2024-10-19 08:20:46,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 08:20:46,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 08:20:46,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2024-10-19 08:20:46,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0dc05c26a/e55aa29446e449e1b6779bd611b3a9c1/FLAG85fa325ab [2024-10-19 08:20:46,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0dc05c26a/e55aa29446e449e1b6779bd611b3a9c1 [2024-10-19 08:20:46,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 08:20:46,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 08:20:46,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 08:20:46,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 08:20:46,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 08:20:46,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:20:46" (1/1) ... [2024-10-19 08:20:46,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e23c705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:46, skipping insertion in model container [2024-10-19 08:20:46,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:20:46" (1/1) ... [2024-10-19 08:20:46,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 08:20:47,614 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i[78860,78873] [2024-10-19 08:20:47,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:20:47,643 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 08:20:47,722 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i[78860,78873] [2024-10-19 08:20:47,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:20:47,844 INFO L204 MainTranslator]: Completed translation [2024-10-19 08:20:47,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47 WrapperNode [2024-10-19 08:20:47,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 08:20:47,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 08:20:47,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 08:20:47,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 08:20:47,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,932 INFO L138 Inliner]: procedures = 485, calls = 74, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 279 [2024-10-19 08:20:47,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 08:20:47,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 08:20:47,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 08:20:47,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 08:20:47,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:47,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:48,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 08:20:48,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 08:20:48,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 08:20:48,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 08:20:48,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (1/1) ... [2024-10-19 08:20:48,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:20:48,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:20:48,041 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 08:20:48,043 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 08:20:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 08:20:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 08:20:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-19 08:20:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-19 08:20:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 08:20:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 08:20:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-19 08:20:48,089 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 08:20:48,366 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 08:20:48,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 08:20:48,874 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 08:20:48,875 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 08:20:49,197 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 08:20:49,198 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-19 08:20:49,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:20:49 BoogieIcfgContainer [2024-10-19 08:20:49,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 08:20:49,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 08:20:49,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 08:20:49,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 08:20:49,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 08:20:46" (1/3) ... [2024-10-19 08:20:49,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ffa5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:20:49, skipping insertion in model container [2024-10-19 08:20:49,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:20:47" (2/3) ... [2024-10-19 08:20:49,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ffa5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:20:49, skipping insertion in model container [2024-10-19 08:20:49,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:20:49" (3/3) ... [2024-10-19 08:20:49,206 INFO L112 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2024-10-19 08:20:49,223 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 08:20:49,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 08:20:49,224 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 08:20:49,292 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-19 08:20:49,336 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:20:49,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:20:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:20:49,338 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 08:20:49,339 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 08:20:49,493 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:20:49,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:49,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-10-19 08:20:49,523 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;@1b3de309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:20:49,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:20:49,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:20:49,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1584528052, now seen corresponding path program 1 times [2024-10-19 08:20:49,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 08:20:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644484863] [2024-10-19 08:20:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 08:20:49,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 08:20:49,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-19 08:20:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:50,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-19 08:20:50,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:20:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:20:50,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 08:20:50,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 08:20:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644484863] [2024-10-19 08:20:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644484863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:20:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:20:50,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:20:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928405682] [2024-10-19 08:20:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:20:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:20:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 08:20:50,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:20:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:20:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,086 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:20:50,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:20:50,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-19 08:20:50,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:50,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:20:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -116859658, now seen corresponding path program 1 times [2024-10-19 08:20:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 08:20:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949899161] [2024-10-19 08:20:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:50,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:50,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 08:20:50,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 08:20:50,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-19 08:20:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:50,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-19 08:20:50,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:20:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:20:50,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 08:20:50,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 08:20:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949899161] [2024-10-19 08:20:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949899161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:20:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:20:50,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:20:50,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838072489] [2024-10-19 08:20:50,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:20:50,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:20:50,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 08:20:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:20:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:20:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,601 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:20:50,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 08:20:50,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:50,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-19 08:20:50,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:50,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:20:50,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1710514629, now seen corresponding path program 1 times [2024-10-19 08:20:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 08:20:50,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54529274] [2024-10-19 08:20:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:50,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 08:20:50,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 08:20:50,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-19 08:20:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:51,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-19 08:20:51,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:20:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:20:51,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:20:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:20:51,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 08:20:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54529274] [2024-10-19 08:20:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54529274] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:20:51,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-19 08:20:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-19 08:20:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691834191] [2024-10-19 08:20:51,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-19 08:20:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-19 08:20:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 08:20:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-19 08:20:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-19 08:20:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:51,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:20:51,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 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 08:20:51,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:51,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:51,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:20:51,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-19 08:20:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:51,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:20:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1717265706, now seen corresponding path program 2 times [2024-10-19 08:20:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 08:20:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544825687] [2024-10-19 08:20:51,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 08:20:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 08:20:51,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 08:20:51,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-19 08:20:51,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-19 08:20:51,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:20:51,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-19 08:20:51,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:20:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:20:51,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 08:20:51,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 08:20:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544825687] [2024-10-19 08:20:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544825687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:20:51,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:20:51,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 08:20:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729016165] [2024-10-19 08:20:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:20:51,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 08:20:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 08:20:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:20:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:20:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:51,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:20:51,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 08:20:51,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:51,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:51,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:20:51,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:20:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:20:52,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-19 08:20:52,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:52,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:20:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1766034468, now seen corresponding path program 1 times [2024-10-19 08:20:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 08:20:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097793804] [2024-10-19 08:20:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:52,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:52,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 08:20:52,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 08:20:52,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-19 08:20:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:52,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-19 08:20:52,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:20:52,504 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 20 treesize of output 8 [2024-10-19 08:20:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:20:52,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:20:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:20:52,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 08:20:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097793804] [2024-10-19 08:20:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097793804] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:20:52,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-19 08:20:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-10-19 08:20:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064780661] [2024-10-19 08:20:52,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-19 08:20:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 08:20:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 08:20:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 08:20:52,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-19 08:20:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:52,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:20:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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 08:20:52,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:52,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:52,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:20:52,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:20:52,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:20:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:20:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:20:52,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-19 08:20:52,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:52,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:20:52,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:20:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1015477859, now seen corresponding path program 1 times [2024-10-19 08:20:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 08:20:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939661221] [2024-10-19 08:20:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:52,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 08:20:52,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 08:20:52,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 08:20:52,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-19 08:20:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:20:53,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-19 08:20:53,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:20:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:20:53,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 08:20:53,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 08:20:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939661221] [2024-10-19 08:20:53,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939661221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:20:53,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:20:53,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:20:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236216289] [2024-10-19 08:20:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:20:53,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 08:20:53,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 08:20:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:20:53,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:20:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:53,211 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:20:53,211 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 08:20:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:20:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:20:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:20:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:20:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:20:56,584 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 35 treesize of output 27 [2024-10-19 08:20:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2102429381, now seen corresponding path program 1 times [2024-10-19 08:20:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:20:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:20:57,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-19 08:20:58,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,SelfDestructingSolverStorable0 [2024-10-19 08:20:58,132 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:672) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 40 more [2024-10-19 08:20:58,138 INFO L158 Benchmark]: Toolchain (without parser) took 11352.66ms. Allocated memory was 62.9MB in the beginning and 161.5MB in the end (delta: 98.6MB). Free memory was 31.4MB in the beginning and 86.4MB in the end (delta: -55.0MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-10-19 08:20:58,138 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 41.9MB. Free memory was 18.6MB in the beginning and 18.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 08:20:58,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1058.80ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.2MB in the beginning and 34.5MB in the end (delta: -3.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-19 08:20:58,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.93ms. Allocated memory is still 75.5MB. Free memory was 34.2MB in the beginning and 30.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-19 08:20:58,139 INFO L158 Benchmark]: Boogie Preprocessor took 68.23ms. Allocated memory is still 75.5MB. Free memory was 30.0MB in the beginning and 45.2MB in the end (delta: -15.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-19 08:20:58,140 INFO L158 Benchmark]: RCFGBuilder took 1192.73ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 45.2MB in the beginning and 54.7MB in the end (delta: -9.5MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-10-19 08:20:58,140 INFO L158 Benchmark]: TraceAbstraction took 8935.15ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 53.8MB in the beginning and 86.4MB in the end (delta: -32.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-19 08:20:58,143 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 41.9MB. Free memory was 18.6MB in the beginning and 18.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1058.80ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.2MB in the beginning and 34.5MB in the end (delta: -3.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.93ms. Allocated memory is still 75.5MB. Free memory was 34.2MB in the beginning and 30.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.23ms. Allocated memory is still 75.5MB. Free memory was 30.0MB in the beginning and 45.2MB in the end (delta: -15.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1192.73ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 45.2MB in the beginning and 54.7MB in the end (delta: -9.5MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8935.15ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 53.8MB in the beginning and 86.4MB in the end (delta: -32.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-19 08:20:58,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-19 08:20:58,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode