./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 20:45:46,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 20:45:47,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 20:45:47,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 20:45:47,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 20:45:47,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 20:45:47,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 20:45:47,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 20:45:47,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 20:45:47,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 20:45:47,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 20:45:47,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 20:45:47,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 20:45:47,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 20:45:47,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 20:45:47,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 20:45:47,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 20:45:47,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 20:45:47,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 20:45:47,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 20:45:47,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 20:45:47,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 20:45:47,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 20:45:47,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 20:45:47,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 20:45:47,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 20:45:47,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 20:45:47,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 20:45:47,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 20:45:47,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 20:45:47,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 20:45:47,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 20:45:47,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 20:45:47,061 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 20:45:47,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 20:45:47,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 20:45:47,061 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 20:45:47,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 20:45:47,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 20:45:47,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 20:45:47,062 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 20:45:47,063 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 213 [2024-10-17 20:45:47,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 20:45:47,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 20:45:47,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 20:45:47,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 20:45:47,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 20:45:47,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 20:45:48,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 20:45:49,078 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 20:45:49,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 20:45:49,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7e5d6e68f/bfbbc31a01034fc6be9b2f6d103c7f09/FLAG07dcae5f0 [2024-10-17 20:45:49,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7e5d6e68f/bfbbc31a01034fc6be9b2f6d103c7f09 [2024-10-17 20:45:49,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 20:45:49,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 20:45:49,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 20:45:49,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 20:45:49,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 20:45:49,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:45:49" (1/1) ... [2024-10-17 20:45:49,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2faa837b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:49, skipping insertion in model container [2024-10-17 20:45:49,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:45:49" (1/1) ... [2024-10-17 20:45:49,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 20:45:49,859 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 20:45:49,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 20:45:49,880 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 20:45:49,934 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 20:45:49,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 20:45:50,017 INFO L204 MainTranslator]: Completed translation [2024-10-17 20:45:50,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50 WrapperNode [2024-10-17 20:45:50,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 20:45:50,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 20:45:50,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 20:45:50,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 20:45:50,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,085 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-17 20:45:50,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 20:45:50,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 20:45:50,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 20:45:50,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 20:45:50,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 20:45:50,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 20:45:50,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 20:45:50,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 20:45:50,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (1/1) ... [2024-10-17 20:45:50,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 20:45:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:45:50,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 20:45:50,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 20:45:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 20:45:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-17 20:45:50,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-17 20:45:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 20:45:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 20:45:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 20:45:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 20:45:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 20:45:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 20:45:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 20:45:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 20:45:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 20:45:50,228 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 20:45:50,383 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 20:45:50,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 20:45:50,570 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 20:45:50,571 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 20:45:50,713 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 20:45:50,713 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 20:45:50,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:45:50 BoogieIcfgContainer [2024-10-17 20:45:50,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 20:45:50,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 20:45:50,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 20:45:50,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 20:45:50,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 08:45:49" (1/3) ... [2024-10-17 20:45:50,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:45:50, skipping insertion in model container [2024-10-17 20:45:50,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:45:50" (2/3) ... [2024-10-17 20:45:50,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:45:50, skipping insertion in model container [2024-10-17 20:45:50,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:45:50" (3/3) ... [2024-10-17 20:45:50,728 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-17 20:45:50,745 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 20:45:50,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 20:45:50,747 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 20:45:50,793 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 20:45:50,838 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:45:50,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:45:50,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:45:50,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:45:50,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 20:45:50,930 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:45:50,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:50,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-17 20:45:50,961 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;@14dae79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:45:50,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:45:51,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:45:51,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-10-17 20:45:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:45:51,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476292613] [2024-10-17 20:45:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:45:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:45:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:45:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:45:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476292613] [2024-10-17 20:45:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476292613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:45:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:45:51,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:45:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745977384] [2024-10-17 20:45:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:45:51,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:45:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:45:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:45:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:45:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:51,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:45:51,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:45:51,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:51,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 20:45:51,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:45:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-10-17 20:45:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:45:51,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442619279] [2024-10-17 20:45:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:45:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:45:52,574 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-17 20:45:52,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:45:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442619279] [2024-10-17 20:45:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442619279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:45:52,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:45:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-17 20:45:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669907061] [2024-10-17 20:45:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:45:52,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 20:45:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:45:52,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 20:45:52,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 20:45:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:52,581 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:45:52,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:45:52,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:52,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:45:52,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-17 20:45:52,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:45:52,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-10-17 20:45:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:45:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031088470] [2024-10-17 20:45:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:45:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:45:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:45:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:45:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031088470] [2024-10-17 20:45:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031088470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:45:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066792491] [2024-10-17 20:45:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:45:54,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:45:54,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:45:54,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 20:45:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:45:54,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-17 20:45:54,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:45:54,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 20:45:54,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 20:45:54,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2024-10-17 20:45:54,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-17 20:45:54,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-10-17 20:45:54,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-10-17 20:45:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:45:56,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:45:57,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_~v~0#1| 1))))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-10-17 20:45:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-17 20:45:57,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066792491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:45:57,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:45:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-10-17 20:45:57,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673675212] [2024-10-17 20:45:57,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:45:57,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-17 20:45:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:45:57,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-17 20:45:57,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=691, Unknown=7, NotChecked=56, Total=930 [2024-10-17 20:45:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:57,964 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:45:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:45:57,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:57,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:45:57,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:45:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 20:45:58,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 20:45:58,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 20:45:58,760 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-17 20:45:58,769 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 20:45:58,773 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-17 20:45:58,776 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:45:58,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:45:58,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:45:58,778 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-17 20:45:58,779 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-17 20:45:58,812 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:45:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:58,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 20:45:58,813 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;@14dae79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:45:58,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:45:58,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:45:58,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-10-17 20:45:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:45:58,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617394354] [2024-10-17 20:45:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:58,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:45:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:45:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:45:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:45:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617394354] [2024-10-17 20:45:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617394354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:45:58,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:45:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:45:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59770971] [2024-10-17 20:45:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:45:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:45:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:45:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:45:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:45:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:58,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:45:58,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:45:58,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:59,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-17 20:45:59,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:45:59,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-10-17 20:45:59,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:45:59,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881265870] [2024-10-17 20:45:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:45:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:45:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:45:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:45:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881265870] [2024-10-17 20:45:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881265870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:45:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:45:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-17 20:45:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137326550] [2024-10-17 20:45:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:45:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 20:45:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:45:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 20:45:59,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 20:45:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:59,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:45:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:45:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:45:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:45:59,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-17 20:45:59,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:45:59,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-10-17 20:45:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:45:59,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746590797] [2024-10-17 20:45:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:45:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:45:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:45:59,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:45:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:45:59,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 20:45:59,742 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 20:45:59,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 20:45:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-17 20:45:59,744 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 20:45:59,747 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-17 20:45:59,747 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 20:45:59,748 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 20:45:59,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 20:45:59,766 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:45:59,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:45:59,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:45:59,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:45:59,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-17 20:45:59,810 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:45:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:45:59,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 20:45:59,811 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;@14dae79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:45:59,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:46:00,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:46:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1146461421, now seen corresponding path program 1 times [2024-10-17 20:46:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618198585] [2024-10-17 20:46:00,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:46:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618198585] [2024-10-17 20:46:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618198585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:46:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:46:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:46:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052539467] [2024-10-17 20:46:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:46:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:46:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:46:00,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:46:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:00,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:00,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-17 20:46:00,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-17 20:46:00,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:46:00,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1959299849, now seen corresponding path program 1 times [2024-10-17 20:46:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52623697] [2024-10-17 20:46:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:46:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52623697] [2024-10-17 20:46:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52623697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:46:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:46:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-17 20:46:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957415114] [2024-10-17 20:46:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:46:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 20:46:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:01,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 20:46:01,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 20:46:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:01,419 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:01,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:46:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:01,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-17 20:46:01,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:46:01,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1017090324, now seen corresponding path program 1 times [2024-10-17 20:46:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:01,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735446230] [2024-10-17 20:46:01,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:46:02,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735446230] [2024-10-17 20:46:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735446230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:46:02,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835349808] [2024-10-17 20:46:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:02,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:46:02,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:46:02,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:46:02,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 20:46:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:02,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-17 20:46:02,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:46:02,472 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 20:46:02,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-17 20:46:02,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 20:46:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-17 20:46:02,859 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 20:46:02,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 20:46:03,037 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-17 20:46:03,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-17 20:46:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:46:03,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:46:03,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of2ForFork0_~v~0#1| 1))))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 20:46:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:46:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835349808] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:46:09,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:46:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-10-17 20:46:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882069971] [2024-10-17 20:46:09,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:46:09,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-17 20:46:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:09,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-17 20:46:09,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1056, Unknown=13, NotChecked=68, Total=1332 [2024-10-17 20:46:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:09,985 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:09,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:46:09,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:09,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:09,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:46:11,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-17 20:46:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-17 20:46:11,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:46:11,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1830282799, now seen corresponding path program 1 times [2024-10-17 20:46:11,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:11,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788726928] [2024-10-17 20:46:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:46:11,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:46:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:46:11,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 20:46:11,351 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 20:46:11,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 20:46:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-17 20:46:11,353 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-17 20:46:11,353 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-17 20:46:11,353 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 20:46:11,354 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-17 20:46:11,373 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 20:46:11,375 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:46:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:46:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:46:11,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:46:11,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-17 20:46:11,418 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:46:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:11,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-17 20:46:11,420 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;@14dae79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:46:11,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:46:12,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:46:12,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 289691451, now seen corresponding path program 1 times [2024-10-17 20:46:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460063549] [2024-10-17 20:46:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 20:46:12,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:12,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460063549] [2024-10-17 20:46:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460063549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:46:12,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:46:12,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:46:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808122283] [2024-10-17 20:46:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:46:12,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:46:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:46:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:46:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:12,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:46:12,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-17 20:46:13,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:46:13,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1893296980, now seen corresponding path program 1 times [2024-10-17 20:46:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59889694] [2024-10-17 20:46:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 20:46:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:14,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59889694] [2024-10-17 20:46:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59889694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:46:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:46:14,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-17 20:46:14,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901039728] [2024-10-17 20:46:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:46:14,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-17 20:46:14,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-17 20:46:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-17 20:46:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:14,527 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:14,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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-17 20:46:14,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:14,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:15,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-17 20:46:15,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:46:15,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash -708586065, now seen corresponding path program 1 times [2024-10-17 20:46:15,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:15,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927406202] [2024-10-17 20:46:15,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:46:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927406202] [2024-10-17 20:46:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927406202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:46:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831808273] [2024-10-17 20:46:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:15,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:46:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:46:15,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:46:15,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 20:46:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:16,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-17 20:46:16,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:46:16,106 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 20:46:16,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-17 20:46:16,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 20:46:16,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-17 20:46:16,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 20:46:16,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 20:46:16,682 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-17 20:46:16,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-17 20:46:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:46:16,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:46:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:46:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831808273] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:46:24,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:46:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-10-17 20:46:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686011514] [2024-10-17 20:46:24,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:46:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-17 20:46:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-17 20:46:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1127, Unknown=21, NotChecked=0, Total=1332 [2024-10-17 20:46:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:24,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:24,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:46:24,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:24,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:24,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 20:46:26,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 20:46:26,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-17 20:46:26,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:46:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash -857142964, now seen corresponding path program 1 times [2024-10-17 20:46:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226414876] [2024-10-17 20:46:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 20:46:27,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226414876] [2024-10-17 20:46:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226414876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:46:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616770402] [2024-10-17 20:46:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:27,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:46:27,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:46:27,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:46:27,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 20:46:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:27,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-17 20:46:27,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:46:27,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 20:46:27,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-17 20:46:27,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:46:27,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-17 20:46:27,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 20:46:27,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-17 20:46:27,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:46:27,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-17 20:46:27,802 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-10-17 20:46:27,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2024-10-17 20:46:27,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 20:46:27,883 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-17 20:46:27,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-17 20:46:27,963 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-10-17 20:46:27,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2024-10-17 20:46:27,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 20:46:27,973 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-17 20:46:27,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2024-10-17 20:46:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 20:46:28,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:46:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616770402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:46:28,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 20:46:28,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-17 20:46:28,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433561287] [2024-10-17 20:46:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:46:28,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 20:46:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:28,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 20:46:28,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-17 20:46:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:28,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:28,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:46:28,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:28,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:28,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 20:46:28,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-17 20:46:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 20:46:31,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-17 20:46:32,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:46:32,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:46:32,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:46:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1144401957, now seen corresponding path program 1 times [2024-10-17 20:46:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 20:46:32,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124273811] [2024-10-17 20:46:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:32,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:46:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:46:34,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 20:46:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124273811] [2024-10-17 20:46:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124273811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 20:46:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788548968] [2024-10-17 20:46:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:46:34,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 20:46:34,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:46:34,742 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 20:46:34,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-17 20:46:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:46:34,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 20:46:34,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:46:34,891 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 20:46:34,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-17 20:46:34,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-17 20:46:34,989 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-17 20:46:34,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-17 20:46:35,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 20:46:35,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 20:46:35,168 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-17 20:46:35,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-17 20:46:35,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 20:46:35,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2024-10-17 20:46:35,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-17 20:46:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2024-10-17 20:46:35,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:46:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:46:35,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:46:36,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 20:46:36,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:46:36,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 237 [2024-10-17 20:46:36,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 20:46:36,971 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 58 treesize of output 54 [2024-10-17 20:46:37,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:46:37,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2024-10-17 20:46:37,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-10-17 20:46:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:46:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788548968] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:46:39,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 20:46:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-10-17 20:46:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692932793] [2024-10-17 20:46:39,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 20:46:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-17 20:46:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 20:46:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-17 20:46:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1826, Unknown=13, NotChecked=0, Total=1980 [2024-10-17 20:46:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:39,388 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:46:39,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:46:39,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:39,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:39,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-17 20:46:39,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 20:46:39,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:46:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 20:46:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-17 20:46:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 20:46:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 20:46:42,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-17 20:46:42,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-17 20:46:42,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:46:42,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-10-17 20:47:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash 878789567, now seen corresponding path program 1 times [2024-10-17 20:47:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 20:47:00,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-17 20:47:00,064 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.ConditionalCommutativityCounterexampleChecker.getInterpolants(ConditionalCommutativityCounterexampleChecker.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) 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) ... 29 more [2024-10-17 20:47:00,070 INFO L158 Benchmark]: Toolchain (without parser) took 70651.59ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 99.4MB in the beginning and 298.2MB in the end (delta: -198.8MB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. [2024-10-17 20:47:00,070 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-17 20:47:00,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.56ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 139.8MB in the end (delta: -40.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-10-17 20:47:00,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.70ms. Allocated memory is still 169.9MB. Free memory was 139.8MB in the beginning and 137.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-17 20:47:00,071 INFO L158 Benchmark]: Boogie Preprocessor took 34.83ms. Allocated memory is still 169.9MB. Free memory was 137.9MB in the beginning and 136.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-17 20:47:00,071 INFO L158 Benchmark]: RCFGBuilder took 584.40ms. Allocated memory is still 169.9MB. Free memory was 136.4MB in the beginning and 114.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-17 20:47:00,071 INFO L158 Benchmark]: TraceAbstraction took 69353.39ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 112.7MB in the beginning and 298.2MB in the end (delta: -185.4MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2024-10-17 20:47:00,075 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.16ms. Allocated memory is still 113.2MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.56ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 139.8MB in the end (delta: -40.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.70ms. Allocated memory is still 169.9MB. Free memory was 139.8MB in the beginning and 137.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.83ms. Allocated memory is still 169.9MB. Free memory was 137.9MB in the beginning and 136.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 584.40ms. Allocated memory is still 169.9MB. Free memory was 136.4MB in the beginning and 114.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 69353.39ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 112.7MB in the beginning and 298.2MB in the end (delta: -185.4MB). Peak memory consumption was 167.8MB. 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: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 843, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 529, dependent conditional: 0, dependent unconditional: 529, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 843, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 529, dependent conditional: 0, dependent unconditional: 529, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 843, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 529, dependent conditional: 0, dependent unconditional: 529, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 843, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 529, dependent conditional: 0, dependent unconditional: 529, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 267, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 267, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 267, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 267, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1167, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 791, dependent conditional: 0, dependent unconditional: 791, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1167, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 791, dependent conditional: 0, dependent unconditional: 791, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 33, Persistent sets #1 benchmarks: Persistent set computation time: 1.2s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1167, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 791, dependent conditional: 0, dependent unconditional: 791, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1167, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 791, dependent conditional: 0, dependent unconditional: 791, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 33 - 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-17 20:47:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:00,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-10-17 20:47:00,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:00,706 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-17 20:47:00,927 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-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 20:47:03,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 20:47:03,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-17 20:47:03,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 20:47:03,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 20:47:03,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 20:47:03,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 20:47:03,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 20:47:03,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 20:47:03,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 20:47:03,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 20:47:03,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 20:47:03,181 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 20:47:03,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 20:47:03,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 20:47:03,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 20:47:03,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 20:47:03,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 20:47:03,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 20:47:03,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 20:47:03,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 20:47:03,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-17 20:47:03,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 20:47:03,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-17 20:47:03,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 20:47:03,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 20:47:03,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 20:47:03,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 20:47:03,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 20:47:03,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 20:47:03,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 20:47:03,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 20:47:03,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 20:47:03,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 20:47:03,191 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 20:47:03,191 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-17 20:47:03,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 20:47:03,192 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 20:47:03,192 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-17 20:47:03,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 20:47:03,193 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-17 20:47:03,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 20:47:03,194 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 20:47:03,194 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 213 [2024-10-17 20:47:03,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 20:47:03,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 20:47:03,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 20:47:03,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 20:47:03,545 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 20:47:03,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 20:47:05,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 20:47:05,354 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 20:47:05,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 20:47:05,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/974d04277/846290593e0e4a778ff56ace30c3755f/FLAG1d98cab48 [2024-10-17 20:47:05,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/974d04277/846290593e0e4a778ff56ace30c3755f [2024-10-17 20:47:05,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 20:47:05,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 20:47:05,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 20:47:05,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 20:47:05,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 20:47:05,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:47:05" (1/1) ... [2024-10-17 20:47:05,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6caf8bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:05, skipping insertion in model container [2024-10-17 20:47:05,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:47:05" (1/1) ... [2024-10-17 20:47:05,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 20:47:06,034 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 20:47:06,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 20:47:06,056 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 20:47:06,112 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 20:47:06,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 20:47:06,157 INFO L204 MainTranslator]: Completed translation [2024-10-17 20:47:06,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06 WrapperNode [2024-10-17 20:47:06,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 20:47:06,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 20:47:06,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 20:47:06,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 20:47:06,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,220 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-10-17 20:47:06,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 20:47:06,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 20:47:06,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 20:47:06,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 20:47:06,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 20:47:06,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 20:47:06,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 20:47:06,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 20:47:06,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (1/1) ... [2024-10-17 20:47:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 20:47:06,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:47:06,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 20:47:06,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 20:47:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-17 20:47:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-17 20:47:06,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-17 20:47:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 20:47:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 20:47:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 20:47:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 20:47:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-17 20:47:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-17 20:47:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-17 20:47:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 20:47:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 20:47:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 20:47:06,337 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 20:47:06,475 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 20:47:06,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 20:47:06,608 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 20:47:06,608 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 20:47:06,779 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 20:47:06,779 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 20:47:06,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:47:06 BoogieIcfgContainer [2024-10-17 20:47:06,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 20:47:06,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 20:47:06,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 20:47:06,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 20:47:06,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 08:47:05" (1/3) ... [2024-10-17 20:47:06,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdf221c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:47:06, skipping insertion in model container [2024-10-17 20:47:06,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:47:06" (2/3) ... [2024-10-17 20:47:06,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdf221c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:47:06, skipping insertion in model container [2024-10-17 20:47:06,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:47:06" (3/3) ... [2024-10-17 20:47:06,790 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-17 20:47:06,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 20:47:06,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 20:47:06,806 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 20:47:06,852 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 20:47:06,895 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:47:06,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:47:06,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:47:06,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:47:06,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 20:47:06,981 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:47:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:06,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-17 20:47:07,002 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;@445e632c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:47:07,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:47:07,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:07,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:07,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1901459519, now seen corresponding path program 1 times [2024-10-17 20:47:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220940253] [2024-10-17 20:47:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:07,332 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-17 20:47:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:07,352 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-17 20:47:07,353 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-17 20:47:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:07,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 20:47:07,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:07,444 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-17 20:47:07,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:07,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220940253] [2024-10-17 20:47:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220940253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:47:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980014002] [2024-10-17 20:47:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:07,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:47:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:47:07,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:47:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:07,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:07,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:07,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:07,783 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-17 20:47:07,982 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-17 20:47:07,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1726443972, now seen corresponding path program 1 times [2024-10-17 20:47:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509262553] [2024-10-17 20:47:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:07,984 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-17 20:47:07,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:07,987 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-17 20:47:07,990 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-17 20:47:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:08,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-17 20:47:08,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:08,170 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:08,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 20:47:08,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 20:47:08,403 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-17 20:47:08,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:08,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509262553] [2024-10-17 20:47:08,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509262553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:08,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:08,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 20:47:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659085334] [2024-10-17 20:47:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:08,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 20:47:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 20:47:08,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 20:47:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:08,408 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:08,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:08,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:08,804 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-17 20:47:08,999 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-17 20:47:09,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash -102633002, now seen corresponding path program 1 times [2024-10-17 20:47:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200602130] [2024-10-17 20:47:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:09,002 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-17 20:47:09,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:09,005 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-17 20:47:09,006 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-17 20:47:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:09,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-17 20:47:09,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:09,133 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-17 20:47:09,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-17 20:47:09,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:47:09,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:47:09,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-17 20:47:09,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-17 20:47:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:47:09,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:09,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:09,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200602130] [2024-10-17 20:47:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200602130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:09,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 20:47:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545424825] [2024-10-17 20:47:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:09,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 20:47:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 20:47:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-17 20:47:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:09,264 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:09,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:09,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:09,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:09,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:09,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 20:47:09,604 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-17 20:47:09,799 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-17 20:47:09,806 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 20:47:09,811 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-17 20:47:09,814 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:47:09,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:47:09,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:47:09,815 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-17 20:47:09,817 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-17 20:47:09,850 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:47:09,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:09,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 20:47:09,852 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;@445e632c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:47:09,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:47:09,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1941491556, now seen corresponding path program 1 times [2024-10-17 20:47:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432534586] [2024-10-17 20:47:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:09,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-17 20:47:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:09,996 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-17 20:47:09,998 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-17 20:47:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:10,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 20:47:10,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:47:10,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:10,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432534586] [2024-10-17 20:47:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432534586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:47:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427515126] [2024-10-17 20:47:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:47:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:47:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:47:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,048 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:10,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:10,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,292 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 (7)] Ended with exit code 0 [2024-10-17 20:47:10,487 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-17 20:47:10,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1255275433, now seen corresponding path program 1 times [2024-10-17 20:47:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568880870] [2024-10-17 20:47:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:10,489 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-17 20:47:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:10,492 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-17 20:47:10,493 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-17 20:47:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:10,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-17 20:47:10,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:10,595 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:10,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:10,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 20:47:10,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 20:47:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:47:10,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:10,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568880870] [2024-10-17 20:47:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568880870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 20:47:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942908915] [2024-10-17 20:47:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 20:47:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 20:47:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 20:47:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,737 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:10,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:10,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:10,909 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-17 20:47:11,102 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 [2024-10-17 20:47:11,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 567669754, now seen corresponding path program 1 times [2024-10-17 20:47:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308899555] [2024-10-17 20:47:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:11,104 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-17 20:47:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:11,107 INFO L229 MonitoredProcess]: Starting monitored process 9 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-17 20:47:11,108 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 (9)] Waiting until timeout for monitored process [2024-10-17 20:47:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:47:11,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:47:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:47:11,239 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-17 20:47:11,240 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 20:47:11,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 20:47:11,245 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 (9)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:11,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-17 20:47:11,447 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 20:47:11,447 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-17 20:47:11,448 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 20:47:11,448 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 20:47:11,467 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 20:47:11,469 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:47:11,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:47:11,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:47:11,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:47:11,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-17 20:47:11,512 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:47:11,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:11,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 20:47:11,514 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;@445e632c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:47:11,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:47:12,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:12,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:12,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1753159339, now seen corresponding path program 1 times [2024-10-17 20:47:12,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:12,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378983402] [2024-10-17 20:47:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:12,547 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-17 20:47:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:12,551 INFO L229 MonitoredProcess]: Starting monitored process 11 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-17 20:47:12,552 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 (11)] Waiting until timeout for monitored process [2024-10-17 20:47:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:12,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 20:47:12,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:47:12,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:12,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378983402] [2024-10-17 20:47:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378983402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:47:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071227778] [2024-10-17 20:47:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:47:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:47:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:47:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:12,615 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-17 20:47:12,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:13,256 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 (11)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-17 20:47:13,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1668501579, now seen corresponding path program 1 times [2024-10-17 20:47:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:13,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453469195] [2024-10-17 20:47:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:13,454 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-17 20:47:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:13,457 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 20:47:13,458 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 (12)] Waiting until timeout for monitored process [2024-10-17 20:47:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:13,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 20:47:13,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:13,592 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:13,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:13,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 20:47:13,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 20:47:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:47:13,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:13,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453469195] [2024-10-17 20:47:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453469195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:13,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 20:47:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314795560] [2024-10-17 20:47:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 20:47:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:13,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 20:47:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 20:47:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:13,705 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:13,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:13,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:13,986 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 (12)] Ended with exit code 0 [2024-10-17 20:47:14,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-17 20:47:14,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1301353490, now seen corresponding path program 1 times [2024-10-17 20:47:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:14,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768786464] [2024-10-17 20:47:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:14,184 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-17 20:47:14,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:14,187 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 20:47:14,189 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 (13)] Waiting until timeout for monitored process [2024-10-17 20:47:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:14,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-17 20:47:14,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:14,318 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 20:47:14,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 20:47:14,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 20:47:14,411 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:14,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:14,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-17 20:47:14,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-17 20:47:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:47:14,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:47:14,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (or (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) .cse0) (or (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_~vn~0#1|)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-10-17 20:47:14,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-10-17 20:47:14,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:47:14,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 26 [2024-10-17 20:47:14,666 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 41 treesize of output 25 [2024-10-17 20:47:14,672 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 11 treesize of output 9 [2024-10-17 20:47:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:47:14,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768786464] [2024-10-17 20:47:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768786464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:47:14,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 20:47:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-17 20:47:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244010128] [2024-10-17 20:47:14,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 20:47:14,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 20:47:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:14,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 20:47:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2024-10-17 20:47:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:14,781 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:14,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:14,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:14,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:14,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 20:47:15,054 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 (13)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:15,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-17 20:47:15,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 20:47:15,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:15,252 INFO L85 PathProgramCache]: Analyzing trace with hash -763680015, now seen corresponding path program 1 times [2024-10-17 20:47:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118161098] [2024-10-17 20:47:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:15,253 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-17 20:47:15,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:15,256 INFO L229 MonitoredProcess]: Starting monitored process 14 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-17 20:47:15,257 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 (14)] Waiting until timeout for monitored process [2024-10-17 20:47:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:47:15,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 20:47:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 20:47:15,386 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-17 20:47:15,387 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 20:47:15,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 20:47:15,392 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 (14)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:15,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-17 20:47:15,589 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-17 20:47:15,590 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-17 20:47:15,590 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 20:47:15,590 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-17 20:47:15,620 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 20:47:15,623 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 20:47:15,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 20:47:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 20:47:15,625 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 20:47:15,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-17 20:47:15,668 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 20:47:15,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:15,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-17 20:47:15,669 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;@445e632c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-17 20:47:15,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 20:47:17,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:17,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1980423421, now seen corresponding path program 1 times [2024-10-17 20:47:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272170579] [2024-10-17 20:47:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:17,706 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-17 20:47:17,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:17,707 INFO L229 MonitoredProcess]: Starting monitored process 16 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-17 20:47:17,708 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 (16)] Waiting until timeout for monitored process [2024-10-17 20:47:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:17,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 20:47:17,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-17 20:47:17,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:17,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272170579] [2024-10-17 20:47:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272170579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 20:47:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281667447] [2024-10-17 20:47:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 20:47:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 20:47:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 20:47:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:17,776 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:17,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:17,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:18,804 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 (16)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:18,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-17 20:47:18,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:19,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:19,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1408669934, now seen corresponding path program 1 times [2024-10-17 20:47:19,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:19,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907886443] [2024-10-17 20:47:19,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:19,001 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-17 20:47:19,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:19,002 INFO L229 MonitoredProcess]: Starting monitored process 17 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-17 20:47:19,004 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 (17)] Waiting until timeout for monitored process [2024-10-17 20:47:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:19,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-17 20:47:19,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:19,303 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-17 20:47:19,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 20:47:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 20:47:19,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:19,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907886443] [2024-10-17 20:47:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907886443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-17 20:47:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221743349] [2024-10-17 20:47:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:19,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 20:47:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 20:47:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-17 20:47:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:19,367 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:19,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:19,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:19,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:19,735 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 (17)] Forceful destruction successful, exit code 0 [2024-10-17 20:47:19,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-17 20:47:19,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:19,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1103172430, now seen corresponding path program 1 times [2024-10-17 20:47:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:19,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732444060] [2024-10-17 20:47:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:19,933 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-17 20:47:19,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:19,934 INFO L229 MonitoredProcess]: Starting monitored process 18 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-17 20:47:19,935 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 (18)] Waiting until timeout for monitored process [2024-10-17 20:47:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:20,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 20:47:20,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:20,064 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-17 20:47:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-17 20:47:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:47:20,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 20:47:20,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 20:47:20,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-10-17 20:47:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-17 20:47:20,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:20,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732444060] [2024-10-17 20:47:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732444060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:20,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 20:47:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076043028] [2024-10-17 20:47:20,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:20,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 20:47:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 20:47:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-17 20:47:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:20,128 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:20,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:20,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:20,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:20,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:20,540 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 (18)] Ended with exit code 0 [2024-10-17 20:47:20,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-17 20:47:20,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 562594897, now seen corresponding path program 1 times [2024-10-17 20:47:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:20,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112999534] [2024-10-17 20:47:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:20,737 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-17 20:47:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:20,740 INFO L229 MonitoredProcess]: Starting monitored process 19 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-17 20:47:20,741 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 (19)] Waiting until timeout for monitored process [2024-10-17 20:47:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:20,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-17 20:47:20,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:20,869 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:20,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:20,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 20:47:20,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 20:47:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 20:47:20,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:47:20,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112999534] [2024-10-17 20:47:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112999534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:47:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:47:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 20:47:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877272363] [2024-10-17 20:47:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:47:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 20:47:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 20:47:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 20:47:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:20,947 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:20,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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-17 20:47:20,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:20,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:20,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:20,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:21,266 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 (19)] Ended with exit code 0 [2024-10-17 20:47:21,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-17 20:47:21,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:21,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1499213391, now seen corresponding path program 1 times [2024-10-17 20:47:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724947185] [2024-10-17 20:47:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:21,464 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-17 20:47:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:21,465 INFO L229 MonitoredProcess]: Starting monitored process 20 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-17 20:47:21,466 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 (20)] Waiting until timeout for monitored process [2024-10-17 20:47:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:21,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-17 20:47:21,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:21,625 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 20:47:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 20:47:21,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 20:47:21,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 20:47:21,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 20:47:21,785 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:21,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:21,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 20:47:21,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 20:47:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:47:21,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:47:21,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-10-17 20:47:21,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (not .cse0) (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (bvadd |c_thr1Thread2of3ForFork0_~v~0#1| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)))))) is different from false [2024-10-17 20:47:22,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) is different from false [2024-10-17 20:47:24,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) (select .cse2 |c_~#value~0.offset|))))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2024-10-17 20:47:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-17 20:47:25,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724947185] [2024-10-17 20:47:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724947185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:47:25,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 20:47:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-17 20:47:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054964449] [2024-10-17 20:47:25,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 20:47:25,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-17 20:47:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:25,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-17 20:47:25,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=208, Unknown=41, NotChecked=140, Total=462 [2024-10-17 20:47:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:25,033 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:25,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:25,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:25,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:25,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:25,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:25,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:28,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 20:47:30,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 20:47:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 20:47:31,365 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 (20)] Ended with exit code 0 [2024-10-17 20:47:31,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-17 20:47:31,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:47:31,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:47:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2110429268, now seen corresponding path program 1 times [2024-10-17 20:47:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:47:31,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428727591] [2024-10-17 20:47:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:47:31,562 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-17 20:47:31,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:47:31,563 INFO L229 MonitoredProcess]: Starting monitored process 21 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-17 20:47:31,564 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 (21)] Waiting until timeout for monitored process [2024-10-17 20:47:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:47:31,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-17 20:47:31,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:47:31,764 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 20:47:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 20:47:31,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 20:47:31,952 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-17 20:47:31,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-10-17 20:47:32,143 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-10-17 20:47:32,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 83 [2024-10-17 20:47:32,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:47:32,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:47:32,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-17 20:47:32,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-17 20:47:32,594 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-17 20:47:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-10-17 20:47:32,748 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 20:47:32,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 20:47:33,117 INFO L349 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2024-10-17 20:47:33,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2024-10-17 20:47:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 20:47:33,164 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-17 20:47:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-17 20:47:33,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-17 20:47:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:47:33,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:47:33,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) is different from false [2024-10-17 20:47:33,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-10-17 20:47:34,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse1 (select .cse3 |c_~#value~0.offset|))) (let ((.cse4 (bvadd (_ bv1 32) .cse1))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1) (= (_ bv0 32) .cse4) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|)))))))))) (or (not .cse0) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse6 (store (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (select (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse8 (bvadd (_ bv1 32) .cse5))) (or (not (bvugt .cse5 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| .cse8)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= (_ bv0 32) .cse8))))))))))) is different from false [2024-10-17 20:47:34,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (= .cse1 (_ bv0 32)) (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-10-17 20:47:34,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (v_ArrVal_274 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (not (= (_ bv0 1) (select (store (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_274) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= .cse1 (_ bv0 32)) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-10-17 20:47:35,005 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-10-17 20:47:35,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 316 treesize of output 308 [2024-10-17 20:47:35,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:47:35,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 136 [2024-10-17 20:47:35,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:47:35,088 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 54 treesize of output 58 [2024-10-17 20:47:35,103 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 154 treesize of output 134 [2024-10-17 20:47:35,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:47:35,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 75 [2024-10-17 20:47:35,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 20:47:35,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2024-10-17 20:47:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-17 20:47:39,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:47:39,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428727591] [2024-10-17 20:47:39,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428727591] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:47:39,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 20:47:39,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-10-17 20:47:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953742283] [2024-10-17 20:47:39,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 20:47:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-17 20:47:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:47:39,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-17 20:47:39,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=410, Unknown=21, NotChecked=230, Total=756 [2024-10-17 20:47:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:39,885 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:47:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:47:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:47:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:47:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:47:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 20:47:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:47:43,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 20:47:46,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 20:47:48,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:47:50,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:47:52,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:47:54,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:47:56,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:47:58,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:01,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:03,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:05,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:08,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 20:48:11,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:13,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:15,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:18,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:19,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:20,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 20:48:22,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:23,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse6 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse6))) (.cse2 (= (_ bv0 32) .cse6))) (and (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (_ bv0 1))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (let ((.cse5 (bvadd (_ bv1 32) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (let ((.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3))) (= (_ bv0 32) .cse5)))))))) is different from false [2024-10-17 20:48:29,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:48:31,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 20:48:31,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5))) (.cse2 (= (_ bv0 32) .cse5)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv3 32) |c_~#value~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))))))) is different from false [2024-10-17 20:48:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:48:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:48:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:48:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-17 20:48:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-17 20:48:35,537 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 (21)] Forceful destruction successful, exit code 0 [2024-10-17 20:48:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-17 20:48:35,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:48:35,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:48:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1277000128, now seen corresponding path program 1 times [2024-10-17 20:48:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:48:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170764373] [2024-10-17 20:48:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:48:35,734 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-17 20:48:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:48:35,737 INFO L229 MonitoredProcess]: Starting monitored process 22 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-17 20:48:35,738 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 (22)] Waiting until timeout for monitored process [2024-10-17 20:48:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:48:35,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-17 20:48:35,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:48:35,923 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-17 20:48:35,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-17 20:48:35,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:48:35,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:48:36,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-17 20:48:36,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-17 20:48:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 20:48:36,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 20:48:36,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:48:36,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170764373] [2024-10-17 20:48:36,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170764373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 20:48:36,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 20:48:36,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 20:48:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756559681] [2024-10-17 20:48:36,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 20:48:36,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 20:48:36,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:48:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 20:48:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-17 20:48:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:36,028 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:48:36,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:48:36,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:36,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:48:36,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:48:36,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:48:36,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-17 20:48:36,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-17 20:48:36,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-17 20:48:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 20:48:38,857 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 (22)] Forceful destruction successful, exit code 0 [2024-10-17 20:48:39,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-17 20:48:39,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:48:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:48:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1825917863, now seen corresponding path program 1 times [2024-10-17 20:48:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:48:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596381729] [2024-10-17 20:48:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 20:48:39,171 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-17 20:48:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:48:39,172 INFO L229 MonitoredProcess]: Starting monitored process 23 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-17 20:48:39,173 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 (23)] Waiting until timeout for monitored process [2024-10-17 20:48:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 20:48:39,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-17 20:48:39,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:48:39,322 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 20:48:39,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 20:48:39,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 20:48:39,448 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-17 20:48:39,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-17 20:48:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 20:48:39,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-10-17 20:48:39,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:48:39,617 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-17 20:48:39,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-17 20:48:39,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-10-17 20:48:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 20:48:39,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 20:48:39,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or (not .cse0) (let ((.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) (not .cse1)) (or (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1)))) (or (forall ((v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse0))) is different from false [2024-10-17 20:48:40,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (_ bv0 1) (select |c_#valid| |c_~#value~0.base|)))) (.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (not .cse0)))) is different from false [2024-10-17 20:48:40,436 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 42 treesize of output 40 [2024-10-17 20:48:40,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-10-17 20:48:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 20:48:52,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:48:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596381729] [2024-10-17 20:48:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596381729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 20:48:52,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 20:48:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-10-17 20:48:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602307501] [2024-10-17 20:48:52,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 20:48:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 20:48:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 20:48:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 20:48:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=256, Unknown=22, NotChecked=70, Total=420 [2024-10-17 20:48:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:52,905 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 20:48:52,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 20:48:52,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:48:52,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:48:52,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:48:52,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:48:52,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-17 20:48:52,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-17 20:48:52,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 20:48:52,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:49:12,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 20:49:12,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse7 (bvadd (_ bv1 32) .cse1))) (let ((.cse6 (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32))) (.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse7))) (.cse2 (= (_ bv0 32) .cse7)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1)) (.cse5 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32)))))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (= (_ bv3 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) .cse5) (not (= (_ bv0 32) .cse6)) (= |c_thr1Thread2of3ForFork0_~v~0#1| .cse6) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) (= (_ bv3 32) |c_~#value~0.base|) .cse5))))) is different from false [2024-10-17 20:49:14,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:49:17,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 20:49:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 20:49:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 20:49:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 20:49:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 20:49:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-17 20:49:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-17 20:49:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 20:49:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 20:49:17,121 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 (23)] Ended with exit code 0 [2024-10-17 20:49:17,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-17 20:49:17,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 20:49:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 20:49:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1492627962, now seen corresponding path program 2 times [2024-10-17 20:49:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 20:49:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049412205] [2024-10-17 20:49:17,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 20:49:17,370 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-17 20:49:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 20:49:17,371 INFO L229 MonitoredProcess]: Starting monitored process 24 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-17 20:49:17,383 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 (24)] Waiting until timeout for monitored process [2024-10-17 20:49:17,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-17 20:49:17,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 20:49:17,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-17 20:49:17,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 20:49:17,557 INFO L349 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2024-10-17 20:49:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2024-10-17 20:49:17,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 20:49:17,612 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-17 20:49:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2024-10-17 20:49:17,806 INFO L349 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2024-10-17 20:49:17,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2024-10-17 20:49:17,903 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-17 20:49:17,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2024-10-17 20:49:17,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 20:49:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049412205] [2024-10-17 20:49:17,962 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-17 20:49:17,967 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 (24)] Ended with exit code 0 [2024-10-17 20:49:18,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-17 20:49:18,163 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) 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) [2024-10-17 20:49:18,167 INFO L158 Benchmark]: Toolchain (without parser) took 132502.54ms. Allocated memory was 69.2MB in the beginning and 255.9MB in the end (delta: 186.6MB). Free memory was 33.0MB in the beginning and 168.1MB in the end (delta: -135.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-10-17 20:49:18,167 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 48.2MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-17 20:49:18,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.30ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 27.7MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-17 20:49:18,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.51ms. Allocated memory is still 69.2MB. Free memory was 27.7MB in the beginning and 46.9MB in the end (delta: -19.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-17 20:49:18,168 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 69.2MB. Free memory was 46.9MB in the beginning and 45.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-17 20:49:18,168 INFO L158 Benchmark]: RCFGBuilder took 516.11ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 40.1MB in the end (delta: 4.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-17 20:49:18,168 INFO L158 Benchmark]: TraceAbstraction took 131384.16ms. Allocated memory was 69.2MB in the beginning and 255.9MB in the end (delta: 186.6MB). Free memory was 38.7MB in the beginning and 168.1MB in the end (delta: -129.4MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-10-17 20:49:18,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 48.2MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.30ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 27.7MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.51ms. Allocated memory is still 69.2MB. Free memory was 27.7MB in the beginning and 46.9MB in the end (delta: -19.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 69.2MB. Free memory was 46.9MB in the beginning and 45.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.11ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 40.1MB in the end (delta: 4.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 131384.16ms. Allocated memory was 69.2MB in the beginning and 255.9MB in the end (delta: 186.6MB). Free memory was 38.7MB in the beginning and 168.1MB in the end (delta: -129.4MB). Peak memory consumption was 57.3MB. 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: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 958, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 958, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 1.0s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 958, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 958, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1725, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 1154, dependent conditional: 0, dependent unconditional: 1154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1725, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 1154, dependent conditional: 0, dependent unconditional: 1154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 34, Persistent sets #1 benchmarks: Persistent set computation time: 1.8s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1725, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 1154, dependent conditional: 0, dependent unconditional: 1154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1725, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 1154, dependent conditional: 0, dependent unconditional: 1154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 34 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-17 20:49:18,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2024-10-17 20:49:18,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2024-10-17 20:49:18,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2024-10-17 20:49:18,799 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-17 20:49:19,039 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index