./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/dekker.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.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 1b6ef65da122b5f043dc58aac5c98a5417eca7613b00ec724ef2626b8a50d79f --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 00:12:51,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 00:12:51,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 00:12:51,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 00:12:51,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 00:12:51,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 00:12:51,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 00:12:51,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 00:12:51,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 00:12:51,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 00:12:51,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 00:12:51,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 00:12:51,265 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 00:12:51,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 00:12:51,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 00:12:51,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 00:12:51,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 00:12:51,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 00:12:51,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 00:12:51,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 00:12:51,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 00:12:51,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 00:12:51,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 00:12:51,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 00:12:51,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 00:12:51,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 00:12:51,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 00:12:51,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 00:12:51,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 00:12:51,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 00:12:51,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 00:12:51,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 00:12:51,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 00:12:51,276 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 00:12:51,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 00:12:51,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 00:12:51,277 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 00:12:51,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 00:12:51,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 00:12:51,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 00:12:51,279 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 00:12:51,279 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 -> 1b6ef65da122b5f043dc58aac5c98a5417eca7613b00ec724ef2626b8a50d79f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 00:12:51,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 00:12:51,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 00:12:51,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 00:12:51,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 00:12:51,605 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 00:12:51,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-10-19 00:12:52,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 00:12:53,215 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 00:12:53,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-10-19 00:12:53,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bd44ddac0/5fb4c4b2bd1942f99816dd9148d6fc21/FLAG8603e2cb5 [2024-10-19 00:12:53,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bd44ddac0/5fb4c4b2bd1942f99816dd9148d6fc21 [2024-10-19 00:12:53,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 00:12:53,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 00:12:53,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 00:12:53,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 00:12:53,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 00:12:53,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce42c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53, skipping insertion in model container [2024-10-19 00:12:53,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 00:12:53,703 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-atomic/dekker.i[31403,31416] [2024-10-19 00:12:53,715 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-atomic/dekker.i[32483,32496] [2024-10-19 00:12:53,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 00:12:53,736 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 00:12:53,788 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-atomic/dekker.i[31403,31416] [2024-10-19 00:12:53,794 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-atomic/dekker.i[32483,32496] [2024-10-19 00:12:53,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 00:12:53,834 INFO L204 MainTranslator]: Completed translation [2024-10-19 00:12:53,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53 WrapperNode [2024-10-19 00:12:53,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 00:12:53,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 00:12:53,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 00:12:53,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 00:12:53,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,880 INFO L138 Inliner]: procedures = 170, calls = 49, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2024-10-19 00:12:53,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 00:12:53,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 00:12:53,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 00:12:53,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 00:12:53,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 00:12:53,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 00:12:53,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 00:12:53,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 00:12:53,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (1/1) ... [2024-10-19 00:12:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 00:12:53,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:12:53,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 00:12:53,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 00:12:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-19 00:12:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-19 00:12:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-19 00:12:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-19 00:12:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 00:12:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 00:12:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 00:12:53,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 00:12:53,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 00:12:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 00:12:53,993 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 00:12:54,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 00:12:54,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 00:12:54,247 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 00:12:54,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 00:12:54,340 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 00:12:54,340 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-19 00:12:54,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 12:12:54 BoogieIcfgContainer [2024-10-19 00:12:54,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 00:12:54,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 00:12:54,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 00:12:54,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 00:12:54,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 12:12:53" (1/3) ... [2024-10-19 00:12:54,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b952ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 12:12:54, skipping insertion in model container [2024-10-19 00:12:54,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 12:12:53" (2/3) ... [2024-10-19 00:12:54,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b952ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 12:12:54, skipping insertion in model container [2024-10-19 00:12:54,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 12:12:54" (3/3) ... [2024-10-19 00:12:54,354 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-10-19 00:12:54,371 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 00:12:54,372 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 00:12:54,373 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 00:12:54,423 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 00:12:54,470 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 00:12:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 00:12:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:12:54,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 00:12:54,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 00:12:54,571 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 00:12:54,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:54,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork1 ======== [2024-10-19 00:12:54,599 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;@38efdf68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 00:12:54,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 00:12:55,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:12:55,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash 507662112, now seen corresponding path program 1 times [2024-10-19 00:12:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:12:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297494132] [2024-10-19 00:12:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 00:12:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:12:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297494132] [2024-10-19 00:12:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297494132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:12:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:12:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 00:12:55,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388574516] [2024-10-19 00:12:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:12:55,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 00:12:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:12:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:12:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:12:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:55,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:12:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:12:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 00:12:55,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:12:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2072631527, now seen corresponding path program 1 times [2024-10-19 00:12:55,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:12:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302153659] [2024-10-19 00:12:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:12:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302153659] [2024-10-19 00:12:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302153659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:12:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:12:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 00:12:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542244420] [2024-10-19 00:12:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:12:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 00:12:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:12:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 00:12:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 00:12:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:55,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:12:55,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:12:55,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:55,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:55,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-19 00:12:55,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:12:55,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1954690333, now seen corresponding path program 1 times [2024-10-19 00:12:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:12:55,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808847853] [2024-10-19 00:12:55,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:12:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808847853] [2024-10-19 00:12:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808847853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:12:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:12:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 00:12:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702742435] [2024-10-19 00:12:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:12:55,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 00:12:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:12:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:12:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:55,978 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:12:55,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:12:55,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:55,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:55,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-19 00:12:56,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:12:56,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -172955971, now seen corresponding path program 1 times [2024-10-19 00:12:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:12:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845661151] [2024-10-19 00:12:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:12:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845661151] [2024-10-19 00:12:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845661151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:12:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:12:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 00:12:56,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920940562] [2024-10-19 00:12:56,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:12:56,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 00:12:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:12:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:12:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:12:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:56,128 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:12:56,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-19 00:12:56,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:56,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:56,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:56,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 257107529, now seen corresponding path program 1 times [2024-10-19 00:12:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1710681407, now seen corresponding path program 1 times [2024-10-19 00:12:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:56,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:12:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:12:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash 257107541, now seen corresponding path program 1 times [2024-10-19 00:12:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1453392648, now seen corresponding path program 1 times [2024-10-19 00:12:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -91255894, now seen corresponding path program 1 times [2024-10-19 00:12:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1542029453, now seen corresponding path program 1 times [2024-10-19 00:12:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1693440057, now seen corresponding path program 1 times [2024-10-19 00:12:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash 978783052, now seen corresponding path program 1 times [2024-10-19 00:12:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 725742414, now seen corresponding path program 1 times [2024-10-19 00:12:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash 220210957, now seen corresponding path program 1 times [2024-10-19 00:12:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash 116888563, now seen corresponding path program 1 times [2024-10-19 00:12:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:57,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 00:12:57,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-19 00:12:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 257107580, now seen corresponding path program 1 times [2024-10-19 00:12:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 978783081, now seen corresponding path program 1 times [2024-10-19 00:12:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 725742439, now seen corresponding path program 1 times [2024-10-19 00:12:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash 220210980, now seen corresponding path program 1 times [2024-10-19 00:12:57,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2127526310, now seen corresponding path program 1 times [2024-10-19 00:12:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 299853409, now seen corresponding path program 1 times [2024-10-19 00:12:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 845797758, now seen corresponding path program 1 times [2024-10-19 00:12:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:57,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-19 00:12:57,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:12:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1523566490, now seen corresponding path program 1 times [2024-10-19 00:12:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:12:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528193710] [2024-10-19 00:12:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:12:57,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528193710] [2024-10-19 00:12:57,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528193710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 00:12:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369115796] [2024-10-19 00:12:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:57,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 00:12:57,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:12:57,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 00:12:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-19 00:12:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:57,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-19 00:12:57,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 00:12:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 00:12:57,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 00:12:57,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369115796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:12:57,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-19 00:12:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-19 00:12:57,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791830746] [2024-10-19 00:12:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:12:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 00:12:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:12:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 00:12:58,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-19 00:12:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:58,001 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:12:58,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-19 00:12:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:58,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:58,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:58,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 257107595, now seen corresponding path program 1 times [2024-10-19 00:12:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash 978783096, now seen corresponding path program 1 times [2024-10-19 00:12:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 220210994, now seen corresponding path program 1 times [2024-10-19 00:12:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2127526326, now seen corresponding path program 1 times [2024-10-19 00:12:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 299853421, now seen corresponding path program 1 times [2024-10-19 00:12:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:58,389 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-19 00:12:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-19 00:12:58,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:12:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash -406397474, now seen corresponding path program 1 times [2024-10-19 00:12:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:12:58,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733267016] [2024-10-19 00:12:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:12:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733267016] [2024-10-19 00:12:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733267016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 00:12:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550843874] [2024-10-19 00:12:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 00:12:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:12:58,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 00:12:58,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-19 00:12:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:12:58,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-19 00:12:58,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 00:12:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:58,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 00:12:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:12:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550843874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 00:12:58,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 00:12:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-19 00:12:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581158115] [2024-10-19 00:12:58,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 00:12:58,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 00:12:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:12:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 00:12:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-19 00:12:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:58,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:12:58,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:12:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:12:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 257107606, now seen corresponding path program 1 times [2024-10-19 00:12:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 220211022, now seen corresponding path program 1 times [2024-10-19 00:12:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2127526354, now seen corresponding path program 1 times [2024-10-19 00:12:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:58,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 299853451, now seen corresponding path program 1 times [2024-10-19 00:12:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash -347634501, now seen corresponding path program 1 times [2024-10-19 00:12:59,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1628700882, now seen corresponding path program 1 times [2024-10-19 00:12:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash 376495249, now seen corresponding path program 1 times [2024-10-19 00:12:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash -502272961, now seen corresponding path program 1 times [2024-10-19 00:12:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:12:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:12:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:12:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:12:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:12:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 00:12:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 00:12:59,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-19 00:12:59,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2024-10-19 00:12:59,517 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 00:12:59,519 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork1 was SAFE (1/3) [2024-10-19 00:12:59,523 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 00:12:59,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 00:12:59,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:12:59,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 00:12:59,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-19 00:12:59,564 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 00:12:59,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:59,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 00:12:59,566 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;@38efdf68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 00:12:59,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 00:12:59,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 00:12:59,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-10-19 00:12:59,707 INFO L414 BasicCegarLoop]: Path program histogram: [] [2024-10-19 00:12:59,707 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2024-10-19 00:12:59,710 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 00:12:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 00:12:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:12:59,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 00:12:59,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-19 00:12:59,752 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 00:12:59,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:12:59,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr2Thread1of1ForFork0 ======== [2024-10-19 00:12:59,753 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;@38efdf68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 00:12:59,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 00:12:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1442343136, now seen corresponding path program 1 times [2024-10-19 00:12:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:12:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:12:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 00:13:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 00:13:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:13:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:13:00,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:13:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:13:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1316223865, now seen corresponding path program 1 times [2024-10-19 00:13:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:13:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670551106] [2024-10-19 00:13:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:13:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670551106] [2024-10-19 00:13:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670551106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:13:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:13:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 00:13:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118192199] [2024-10-19 00:13:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:13:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 00:13:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:13:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 00:13:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 00:13:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,159 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:13:00,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-19 00:13:00,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:00,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-19 00:13:00,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:13:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:13:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1196243551, now seen corresponding path program 1 times [2024-10-19 00:13:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:13:00,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374733768] [2024-10-19 00:13:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:13:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374733768] [2024-10-19 00:13:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374733768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:13:00,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:13:00,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 00:13:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437878615] [2024-10-19 00:13:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:13:00,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 00:13:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:13:00,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:13:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:13:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,279 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:13:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:13:00,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:00,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:00,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-19 00:13:00,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:13:00,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:13:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 390597881, now seen corresponding path program 1 times [2024-10-19 00:13:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:13:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002019374] [2024-10-19 00:13:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:00,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:13:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002019374] [2024-10-19 00:13:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002019374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:13:00,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:13:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 00:13:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955413509] [2024-10-19 00:13:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:13:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 00:13:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:13:00,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:13:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 00:13:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,367 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:13:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:13:00,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:00,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:00,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:13:00,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-19 00:13:00,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:13:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:13:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1805079459, now seen corresponding path program 1 times [2024-10-19 00:13:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:13:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341860391] [2024-10-19 00:13:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 00:13:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:13:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341860391] [2024-10-19 00:13:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341860391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 00:13:00,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 00:13:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 00:13:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988286622] [2024-10-19 00:13:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 00:13:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 00:13:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:13:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 00:13:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 00:13:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,429 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:13:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:13:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 00:13:00,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2116287161, now seen corresponding path program 1 times [2024-10-19 00:13:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -172931493, now seen corresponding path program 1 times [2024-10-19 00:13:00,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2145777236, now seen corresponding path program 1 times [2024-10-19 00:13:00,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -507918454, now seen corresponding path program 1 times [2024-10-19 00:13:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash 882515692, now seen corresponding path program 1 times [2024-10-19 00:13:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2074778866, now seen corresponding path program 1 times [2024-10-19 00:13:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 853025611, now seen corresponding path program 1 times [2024-10-19 00:13:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash -581447703, now seen corresponding path program 1 times [2024-10-19 00:13:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2031374376, now seen corresponding path program 1 times [2024-10-19 00:13:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1730244482, now seen corresponding path program 1 times [2024-10-19 00:13:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash 257107771, now seen corresponding path program 1 times [2024-10-19 00:13:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash 862471623, now seen corresponding path program 1 times [2024-10-19 00:13:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 00:13:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 00:13:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:13:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-19 00:13:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2116287119, now seen corresponding path program 1 times [2024-10-19 00:13:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -172931453, now seen corresponding path program 1 times [2024-10-19 00:13:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2145777194, now seen corresponding path program 1 times [2024-10-19 00:13:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash -507918408, now seen corresponding path program 1 times [2024-10-19 00:13:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash 882515736, now seen corresponding path program 1 times [2024-10-19 00:13:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2074778912, now seen corresponding path program 1 times [2024-10-19 00:13:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,378 INFO L85 PathProgramCache]: Analyzing trace with hash 853025659, now seen corresponding path program 1 times [2024-10-19 00:13:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2031374425, now seen corresponding path program 1 times [2024-10-19 00:13:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1730244527, now seen corresponding path program 1 times [2024-10-19 00:13:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 257107816, now seen corresponding path program 1 times [2024-10-19 00:13:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -156811195, now seen corresponding path program 1 times [2024-10-19 00:13:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 00:13:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 00:13:01,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:13:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-19 00:13:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -172931405, now seen corresponding path program 1 times [2024-10-19 00:13:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2145777146, now seen corresponding path program 1 times [2024-10-19 00:13:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2031374469, now seen corresponding path program 1 times [2024-10-19 00:13:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 257107859, now seen corresponding path program 1 times [2024-10-19 00:13:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:01,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1453392322, now seen corresponding path program 1 times [2024-10-19 00:13:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -91255556, now seen corresponding path program 1 times [2024-10-19 00:13:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1542029795, now seen corresponding path program 1 times [2024-10-19 00:13:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1693440403, now seen corresponding path program 1 times [2024-10-19 00:13:02,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash 978783398, now seen corresponding path program 1 times [2024-10-19 00:13:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash 725742760, now seen corresponding path program 1 times [2024-10-19 00:13:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash 220211303, now seen corresponding path program 1 times [2024-10-19 00:13:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash -661575830, now seen corresponding path program 1 times [2024-10-19 00:13:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 00:13:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-19 00:13:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 257107942, now seen corresponding path program 1 times [2024-10-19 00:13:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 978783459, now seen corresponding path program 1 times [2024-10-19 00:13:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 725742817, now seen corresponding path program 1 times [2024-10-19 00:13:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 220211360, now seen corresponding path program 1 times [2024-10-19 00:13:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable50,SelfDestructingSolverStorable72,SelfDestructingSolverStorable51,SelfDestructingSolverStorable73,SelfDestructingSolverStorable52,SelfDestructingSolverStorable74,SelfDestructingSolverStorable53,SelfDestructingSolverStorable75,SelfDestructingSolverStorable54,SelfDestructingSolverStorable76,SelfDestructingSolverStorable55,SelfDestructingSolverStorable77,SelfDestructingSolverStorable56,SelfDestructingSolverStorable78,SelfDestructingSolverStorable57,SelfDestructingSolverStorable79,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable60,SelfDestructingSolverStorable82,SelfDestructingSolverStorable61,SelfDestructingSolverStorable83,SelfDestructingSolverStorable62,SelfDestructingSolverStorable84,SelfDestructingSolverStorable63,SelfDestructingSolverStorable85,SelfDestructingSolverStorable64,SelfDestructingSolverStorable86,SelfDestructingSolverStorable65,SelfDestructingSolverStorable44,SelfDestructingSolverStorable66,SelfDestructingSolverStorable45,SelfDestructingSolverStorable67,SelfDestructingSolverStorable46,SelfDestructingSolverStorable68,SelfDestructingSolverStorable47,SelfDestructingSolverStorable69,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-10-19 00:13:02,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 00:13:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 00:13:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1062688554, now seen corresponding path program 1 times [2024-10-19 00:13:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 00:13:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540322898] [2024-10-19 00:13:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 00:13:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540322898] [2024-10-19 00:13:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540322898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 00:13:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102133812] [2024-10-19 00:13:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:02,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 00:13:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 00:13:02,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 00:13:02,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-19 00:13:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 00:13:02,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-19 00:13:02,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 00:13:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:02,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 00:13:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 00:13:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102133812] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 00:13:02,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 00:13:02,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-19 00:13:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143235055] [2024-10-19 00:13:02,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 00:13:02,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 00:13:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 00:13:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 00:13:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-19 00:13:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:02,973 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 00:13:02,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 00:13:02,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:02,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:02,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:02,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:02,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 00:13:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash 257108000, now seen corresponding path program 1 times [2024-10-19 00:13:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:03,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 978783523, now seen corresponding path program 1 times [2024-10-19 00:13:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:03,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:03,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash 220211427, now seen corresponding path program 1 times [2024-10-19 00:13:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 00:13:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 00:13:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:03,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 00:13:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 00:13:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 00:13:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 00:13:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 00:13:03,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 00:13:03,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-19 00:13:03,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable87,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89 [2024-10-19 00:13:03,534 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 00:13:03,534 INFO L312 ceAbstractionStarter]: Result for error location thr2Thread1of1ForFork0 was SAFE (3/3) [2024-10-19 00:13:03,534 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 00:13:03,535 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 00:13:03,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 12:13:03 BasicIcfg [2024-10-19 00:13:03,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 00:13:03,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 00:13:03,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 00:13:03,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 00:13:03,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 12:12:54" (3/4) ... [2024-10-19 00:13:03,541 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-19 00:13:03,544 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-10-19 00:13:03,545 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-10-19 00:13:03,548 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2024-10-19 00:13:03,549 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-19 00:13:03,549 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-19 00:13:03,549 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-19 00:13:03,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 00:13:03,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2024-10-19 00:13:03,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 00:13:03,628 INFO L158 Benchmark]: Toolchain (without parser) took 10371.91ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 144.1MB in the beginning and 140.7MB in the end (delta: 3.3MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,628 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 00:13:03,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.96ms. Allocated memory is still 176.2MB. Free memory was 144.1MB in the beginning and 120.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.62ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,629 INFO L158 Benchmark]: Boogie Preprocessor took 29.34ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 117.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,629 INFO L158 Benchmark]: RCFGBuilder took 429.53ms. Allocated memory is still 176.2MB. Free memory was 117.1MB in the beginning and 97.3MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,630 INFO L158 Benchmark]: TraceAbstraction took 9192.82ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 96.1MB in the beginning and 144.9MB in the end (delta: -48.8MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,630 INFO L158 Benchmark]: Witness Printer took 88.72ms. Allocated memory is still 272.6MB. Free memory was 144.9MB in the beginning and 140.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-19 00:13:03,631 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.19ms. Allocated memory is still 117.4MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.96ms. Allocated memory is still 176.2MB. Free memory was 144.1MB in the beginning and 120.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.62ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.34ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 117.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.53ms. Allocated memory is still 176.2MB. Free memory was 117.1MB in the beginning and 97.3MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9192.82ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 96.1MB in the beginning and 144.9MB in the end (delta: -48.8MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Witness Printer took 88.72ms. Allocated memory is still 272.6MB. Free memory was 144.9MB in the beginning and 140.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 8150, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 757, dependent conditional: 720, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7568, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 175, dependent conditional: 138, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7568, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 175, dependent conditional: 138, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7568, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 175, dependent conditional: 138, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 660, dependent conditional: 586, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1269, independent: 1194, independent conditional: 38, independent unconditional: 1156, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1269, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1071, independent: 102, independent conditional: 12, independent unconditional: 90, dependent: 969, dependent conditional: 373, dependent unconditional: 596, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8053, independent: 6199, independent conditional: 2017, independent unconditional: 4182, dependent: 585, dependent conditional: 56, dependent unconditional: 529, unknown: 1269, unknown conditional: 78, unknown unconditional: 1191] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1194, Positive conditional cache size: 38, Positive unconditional cache size: 1156, Negative cache size: 75, Negative conditional cache size: 40, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4332, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 660, dependent conditional: 586, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1269, independent: 1194, independent conditional: 38, independent unconditional: 1156, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1269, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1071, independent: 102, independent conditional: 12, independent unconditional: 90, dependent: 969, dependent conditional: 373, dependent unconditional: 596, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8053, independent: 6199, independent conditional: 2017, independent unconditional: 4182, dependent: 585, dependent conditional: 56, dependent unconditional: 529, unknown: 1269, unknown conditional: 78, unknown unconditional: 1191] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1194, Positive conditional cache size: 38, Positive unconditional cache size: 1156, Negative cache size: 75, Negative conditional cache size: 40, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4332 ], Independence queries for same thread: 582, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 354, Number of trivial persistent sets: 329, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1444, independent: 1409, independent conditional: 0, independent unconditional: 1409, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8150, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 757, dependent conditional: 720, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7568, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 175, dependent conditional: 138, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7568, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 175, dependent conditional: 138, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7568, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 175, dependent conditional: 138, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 660, dependent conditional: 586, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1269, independent: 1194, independent conditional: 38, independent unconditional: 1156, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1269, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1071, independent: 102, independent conditional: 12, independent unconditional: 90, dependent: 969, dependent conditional: 373, dependent unconditional: 596, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8053, independent: 6199, independent conditional: 2017, independent unconditional: 4182, dependent: 585, dependent conditional: 56, dependent unconditional: 529, unknown: 1269, unknown conditional: 78, unknown unconditional: 1191] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1194, Positive conditional cache size: 38, Positive unconditional cache size: 1156, Negative cache size: 75, Negative conditional cache size: 40, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4332, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 5897, independent unconditional: 1496, dependent: 660, dependent conditional: 586, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8053, independent: 7393, independent conditional: 2055, independent unconditional: 5338, dependent: 660, dependent conditional: 96, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1269, independent: 1194, independent conditional: 38, independent unconditional: 1156, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1269, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 75, dependent conditional: 40, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1071, independent: 102, independent conditional: 12, independent unconditional: 90, dependent: 969, dependent conditional: 373, dependent unconditional: 596, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8053, independent: 6199, independent conditional: 2017, independent unconditional: 4182, dependent: 585, dependent conditional: 56, dependent unconditional: 529, unknown: 1269, unknown conditional: 78, unknown unconditional: 1191] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1194, Positive conditional cache size: 38, Positive unconditional cache size: 1156, Negative cache size: 75, Negative conditional cache size: 40, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4332 ], Independence queries for same thread: 582 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 222, independent: 215, independent conditional: 5, independent unconditional: 210, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 220, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 220, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 220, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 225, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 210, independent: 205, independent conditional: 0, independent unconditional: 205, 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: 210, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 225, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 210, unknown conditional: 0, unknown unconditional: 210] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, 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: 5, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 210, independent: 205, independent conditional: 0, independent unconditional: 205, 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: 210, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 225, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 210, unknown conditional: 0, unknown unconditional: 210] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, 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: 5 ], Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 10, Number of trivial persistent sets: 8, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 205, independent conditional: 0, independent unconditional: 205, 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: 222, independent: 215, independent conditional: 5, independent unconditional: 210, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 220, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 220, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 220, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 225, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 210, independent: 205, independent conditional: 0, independent unconditional: 205, 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: 210, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 225, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 210, unknown conditional: 0, unknown unconditional: 210] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, 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: 5, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225, independent: 215, independent conditional: 5, independent unconditional: 210, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 225, independent: 215, independent conditional: 0, independent unconditional: 215, 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: 210, independent: 205, independent conditional: 0, independent unconditional: 205, 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: 210, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 225, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 210, unknown conditional: 0, unknown unconditional: 210] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, 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: 5 ], Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8592, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 898, dependent conditional: 857, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7960, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 266, dependent conditional: 225, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7960, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 266, dependent conditional: 225, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7960, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 266, dependent conditional: 225, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 1047, dependent conditional: 965, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, independent: 1144, independent conditional: 35, independent unconditional: 1109, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1181, independent: 62, independent conditional: 16, independent unconditional: 46, dependent: 1119, dependent conditional: 819, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8741, independent: 6550, independent conditional: 2008, independent unconditional: 4542, dependent: 895, dependent conditional: 191, dependent unconditional: 704, unknown: 1296, unknown conditional: 149, unknown unconditional: 1147] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1144, Positive conditional cache size: 35, Positive unconditional cache size: 1109, Negative cache size: 152, Negative conditional cache size: 114, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4893, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 1047, dependent conditional: 965, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, independent: 1144, independent conditional: 35, independent unconditional: 1109, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1181, independent: 62, independent conditional: 16, independent unconditional: 46, dependent: 1119, dependent conditional: 819, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8741, independent: 6550, independent conditional: 2008, independent unconditional: 4542, dependent: 895, dependent conditional: 191, dependent unconditional: 704, unknown: 1296, unknown conditional: 149, unknown unconditional: 1147] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1144, Positive conditional cache size: 35, Positive unconditional cache size: 1109, Negative cache size: 152, Negative conditional cache size: 114, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4893 ], Independence queries for same thread: 632, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 393, Number of trivial persistent sets: 350, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1371, independent: 1333, independent conditional: 0, independent unconditional: 1333, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8592, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 898, dependent conditional: 857, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7960, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 266, dependent conditional: 225, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7960, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 266, dependent conditional: 225, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7960, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 266, dependent conditional: 225, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 1047, dependent conditional: 965, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, independent: 1144, independent conditional: 35, independent unconditional: 1109, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1181, independent: 62, independent conditional: 16, independent unconditional: 46, dependent: 1119, dependent conditional: 819, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8741, independent: 6550, independent conditional: 2008, independent unconditional: 4542, dependent: 895, dependent conditional: 191, dependent unconditional: 704, unknown: 1296, unknown conditional: 149, unknown unconditional: 1147] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1144, Positive conditional cache size: 35, Positive unconditional cache size: 1109, Negative cache size: 152, Negative conditional cache size: 114, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4893, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 6276, independent unconditional: 1418, dependent: 1047, dependent conditional: 965, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8741, independent: 7694, independent conditional: 2043, independent unconditional: 5651, dependent: 1047, dependent conditional: 305, dependent unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, independent: 1144, independent conditional: 35, independent unconditional: 1109, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 159, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 152, dependent conditional: 114, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1181, independent: 62, independent conditional: 16, independent unconditional: 46, dependent: 1119, dependent conditional: 819, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8741, independent: 6550, independent conditional: 2008, independent unconditional: 4542, dependent: 895, dependent conditional: 191, dependent unconditional: 704, unknown: 1296, unknown conditional: 149, unknown unconditional: 1147] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1144, Positive conditional cache size: 35, Positive unconditional cache size: 1109, Negative cache size: 152, Negative conditional cache size: 114, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4893 ], Independence queries for same thread: 632 - PositiveResult [Line: 739]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 780]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 91 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 351 SizeOfPredicates, 1 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 7/11 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 1.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 33, ConditionalCommutativityTraceChecks: 31, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 91 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 91 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 1 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 2.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 4, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 43, ConditionalCommutativityTraceChecks: 43, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-19 00:13:03,672 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-19 00:13:03,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-10-19 00:13:04,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-19 00:13:04,270 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: TRUE