./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 13:45:28,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 13:45:28,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 13:45:28,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 13:45:28,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 13:45:28,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 13:45:28,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 13:45:28,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 13:45:28,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 13:45:28,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 13:45:28,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 13:45:28,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 13:45:28,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 13:45:28,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 13:45:28,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 13:45:28,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 13:45:28,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 13:45:28,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 13:45:28,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 13:45:28,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 13:45:28,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 13:45:28,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 13:45:28,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 13:45:28,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 13:45:28,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 13:45:28,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 13:45:28,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 13:45:28,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 13:45:28,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 13:45:28,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 13:45:28,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 13:45:28,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 13:45:28,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 13:45:28,348 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 13:45:28,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 13:45:28,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 13:45:28,348 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 13:45:28,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 13:45:28,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 13:45:28,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 13:45:28,349 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 13:45:28,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-17 13:45:28,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 13:45:28,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 13:45:28,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 13:45:28,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 13:45:28,622 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 13:45:28,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 13:45:30,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 13:45:30,307 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 13:45:30,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 13:45:30,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9aec1d60/a0a4722ede40457dac858643c955af27/FLAG29ac0629d [2024-10-17 13:45:30,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9aec1d60/a0a4722ede40457dac858643c955af27 [2024-10-17 13:45:30,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 13:45:30,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 13:45:30,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 13:45:30,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 13:45:30,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 13:45:30,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 01:45:30" (1/1) ... [2024-10-17 13:45:30,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab14923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:30, skipping insertion in model container [2024-10-17 13:45:30,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 01:45:30" (1/1) ... [2024-10-17 13:45:30,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 13:45:31,044 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 13:45:31,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 13:45:31,083 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 13:45:31,137 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 13:45:31,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 13:45:31,173 INFO L204 MainTranslator]: Completed translation [2024-10-17 13:45:31,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31 WrapperNode [2024-10-17 13:45:31,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 13:45:31,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 13:45:31,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 13:45:31,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 13:45:31,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,212 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-17 13:45:31,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 13:45:31,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 13:45:31,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 13:45:31,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 13:45:31,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 13:45:31,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 13:45:31,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 13:45:31,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 13:45:31,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (1/1) ... [2024-10-17 13:45:31,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 13:45:31,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:31,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 13:45:31,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 13:45:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 13:45:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-17 13:45:31,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-17 13:45:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 13:45:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 13:45:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 13:45:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 13:45:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 13:45:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 13:45:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 13:45:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 13:45:31,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 13:45:31,336 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 13:45:31,490 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 13:45:31,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 13:45:31,682 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 13:45:31,682 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 13:45:31,843 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 13:45:31,844 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 13:45:31,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 01:45:31 BoogieIcfgContainer [2024-10-17 13:45:31,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 13:45:31,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 13:45:31,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 13:45:31,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 13:45:31,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 01:45:30" (1/3) ... [2024-10-17 13:45:31,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f6b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 01:45:31, skipping insertion in model container [2024-10-17 13:45:31,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:45:31" (2/3) ... [2024-10-17 13:45:31,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f6b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 01:45:31, skipping insertion in model container [2024-10-17 13:45:31,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 01:45:31" (3/3) ... [2024-10-17 13:45:31,857 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-17 13:45:31,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 13:45:31,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 13:45:31,876 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 13:45:31,921 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 13:45:31,966 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:45:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:45:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:31,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:45:31,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 13:45:32,063 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:45:32,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:32,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-17 13:45:32,096 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2de11c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:45:32,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:45:32,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:45:32,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-10-17 13:45:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726591310] [2024-10-17 13:45:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:32,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726591310] [2024-10-17 13:45:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726591310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:32,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:45:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208869614] [2024-10-17 13:45:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:45:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:45:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:45:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:32,700 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:32,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:32,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:32,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 13:45:32,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:45:32,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:32,977 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-10-17 13:45:32,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409161736] [2024-10-17 13:45:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409161736] [2024-10-17 13:45:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409161736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:33,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-17 13:45:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732592236] [2024-10-17 13:45:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 13:45:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 13:45:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 13:45:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:33,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:33,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:33,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:33,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:34,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-17 13:45:34,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:45:34,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-10-17 13:45:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139501773] [2024-10-17 13:45:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139501773] [2024-10-17 13:45:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139501773] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:45:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314842752] [2024-10-17 13:45:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:45:35,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:35,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:45:35,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 13:45:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:35,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-17 13:45:35,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:45:35,571 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 13:45:35,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 13:45:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2024-10-17 13:45:35,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-17 13:45:35,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-10-17 13:45:36,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-10-17 13:45:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:38,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:45:38,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-10-17 13:45:38,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_~v~0#1| 1))))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-10-17 13:45:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-17 13:45:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314842752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:45:39,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:45:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-10-17 13:45:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132842417] [2024-10-17 13:45:39,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:45:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-17 13:45:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-17 13:45:39,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=644, Unknown=3, NotChecked=110, Total=930 [2024-10-17 13:45:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:39,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:39,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 13:45:39,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 13:45:39,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 13:45:39,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-17 13:45:39,878 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 13:45:39,880 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-17 13:45:39,883 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:45:39,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:45:39,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:39,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:45:39,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-17 13:45:39,925 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:45:39,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:39,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 13:45:39,927 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;@2de11c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:45:39,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:45:40,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:40,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:40,047 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-10-17 13:45:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918278040] [2024-10-17 13:45:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918278040] [2024-10-17 13:45:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918278040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:40,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:45:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594512723] [2024-10-17 13:45:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:45:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:45:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:45:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:40,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:40,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-17 13:45:40,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:40,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-10-17 13:45:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:40,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918030418] [2024-10-17 13:45:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:40,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918030418] [2024-10-17 13:45:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918030418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-17 13:45:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460523905] [2024-10-17 13:45:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:40,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 13:45:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 13:45:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 13:45:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:40,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:40,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:40,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-17 13:45:40,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-10-17 13:45:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457311352] [2024-10-17 13:45:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:45:40,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:45:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:45:40,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 13:45:40,778 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 13:45:40,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 13:45:40,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-17 13:45:40,783 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 13:45:40,783 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-17 13:45:40,786 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 13:45:40,786 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 13:45:40,806 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 13:45:40,808 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:45:40,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:45:40,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:40,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:45:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-17 13:45:40,852 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:45:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:40,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 13:45:40,855 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;@2de11c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:45:40,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:45:41,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:41,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1146461421, now seen corresponding path program 1 times [2024-10-17 13:45:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760729077] [2024-10-17 13:45:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:45:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760729077] [2024-10-17 13:45:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760729077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:41,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:45:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469790691] [2024-10-17 13:45:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:41,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:45:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:45:41,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:45:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:41,550 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:41,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:41,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:42,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-17 13:45:42,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1959299849, now seen corresponding path program 1 times [2024-10-17 13:45:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451669326] [2024-10-17 13:45:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:45:42,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:42,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451669326] [2024-10-17 13:45:42,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451669326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:42,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:42,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-17 13:45:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636423347] [2024-10-17 13:45:42,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:42,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 13:45:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:42,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 13:45:42,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 13:45:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:42,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:42,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:42,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:42,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:42,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-17 13:45:42,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1017090324, now seen corresponding path program 1 times [2024-10-17 13:45:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:42,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839865341] [2024-10-17 13:45:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:43,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839865341] [2024-10-17 13:45:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839865341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:45:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595477198] [2024-10-17 13:45:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:43,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:45:43,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:43,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:45:43,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 13:45:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:43,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-17 13:45:43,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:45:43,557 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 13:45:43,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-17 13:45:43,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 13:45:43,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-17 13:45:43,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 13:45:43,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 13:45:44,093 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-17 13:45:44,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-17 13:45:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:44,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:45:44,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_~vn~0#1|)))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 13:45:44,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of2ForFork0_~v~0#1| 1))))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 13:45:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:45:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595477198] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:45:54,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:45:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-10-17 13:45:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964932210] [2024-10-17 13:45:54,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:45:54,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-17 13:45:54,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-17 13:45:54,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=995, Unknown=11, NotChecked=134, Total=1332 [2024-10-17 13:45:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:54,386 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:54,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:54,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:54,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:45:55,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-17 13:45:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-17 13:45:55,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:45:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1830282799, now seen corresponding path program 1 times [2024-10-17 13:45:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691015024] [2024-10-17 13:45:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:45:55,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:45:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:45:55,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 13:45:55,689 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 13:45:55,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 13:45:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-17 13:45:55,693 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-17 13:45:55,694 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-17 13:45:55,694 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 13:45:55,694 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-17 13:45:55,718 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 13:45:55,721 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:45:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:45:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:45:55,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:45:55,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-17 13:45:55,769 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:45:55,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:55,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-17 13:45:55,772 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;@2de11c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:45:55,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:45:57,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:45:57,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash 289691451, now seen corresponding path program 1 times [2024-10-17 13:45:57,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:57,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642733933] [2024-10-17 13:45:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 13:45:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:57,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642733933] [2024-10-17 13:45:57,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642733933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:57,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:57,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:45:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507910884] [2024-10-17 13:45:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:57,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:45:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:45:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:45:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:57,365 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:57,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:58,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-17 13:45:58,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:45:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1893296980, now seen corresponding path program 1 times [2024-10-17 13:45:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:58,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793678121] [2024-10-17 13:45:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:45:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 13:45:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:45:58,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793678121] [2024-10-17 13:45:58,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793678121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:45:58,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:45:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-17 13:45:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869673011] [2024-10-17 13:45:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:45:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-17 13:45:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:45:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-17 13:45:58,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-17 13:45:58,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:58,826 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:45:58,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:45:58,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:58,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:45:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:45:59,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-17 13:45:59,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:45:59,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:45:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -708586065, now seen corresponding path program 1 times [2024-10-17 13:45:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:45:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686824423] [2024-10-17 13:45:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:45:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:45:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:46:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:46:00,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686824423] [2024-10-17 13:46:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686824423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:46:00,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364995299] [2024-10-17 13:46:00,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:00,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:46:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:00,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:46:00,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 13:46:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:00,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-17 13:46:00,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:00,183 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 13:46:00,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-17 13:46:00,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 13:46:00,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-17 13:46:00,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 13:46:00,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 13:46:00,729 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-17 13:46:00,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-17 13:46:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:00,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:46:00,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse1 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or .cse0 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 13:46:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:08,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364995299] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:46:08,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:46:08,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-10-17 13:46:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113629144] [2024-10-17 13:46:08,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:46:08,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-17 13:46:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:46:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-17 13:46:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1072, Unknown=12, NotChecked=68, Total=1332 [2024-10-17 13:46:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:08,974 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:08,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:46:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:46:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 13:46:10,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 13:46:11,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-17 13:46:11,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:46:11,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash -857142964, now seen corresponding path program 1 times [2024-10-17 13:46:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:46:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194063802] [2024-10-17 13:46:11,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:46:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 13:46:11,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:46:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194063802] [2024-10-17 13:46:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194063802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:46:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913385416] [2024-10-17 13:46:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:11,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:46:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:11,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:46:11,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 13:46:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:11,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-17 13:46:11,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:11,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 13:46:11,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-17 13:46:11,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:46:11,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-17 13:46:11,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 13:46:11,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-17 13:46:11,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:46:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-17 13:46:12,079 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-10-17 13:46:12,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2024-10-17 13:46:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 13:46:12,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-17 13:46:12,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-17 13:46:12,252 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-10-17 13:46:12,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2024-10-17 13:46:12,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 13:46:12,264 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-17 13:46:12,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2024-10-17 13:46:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 13:46:12,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913385416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 13:46:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-17 13:46:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17238732] [2024-10-17 13:46:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 13:46:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:46:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 13:46:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-17 13:46:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:12,361 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:12,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:12,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:46:12,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 13:46:12,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:46:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-17 13:46:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 13:46:17,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-17 13:46:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:46:17,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:46:17,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1144401957, now seen corresponding path program 1 times [2024-10-17 13:46:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 13:46:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565177673] [2024-10-17 13:46:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:17,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:46:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 13:46:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565177673] [2024-10-17 13:46:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565177673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 13:46:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715566037] [2024-10-17 13:46:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 13:46:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:20,037 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 13:46:20,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-17 13:46:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:20,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 13:46:20,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:20,182 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 13:46:20,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-17 13:46:20,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-17 13:46:20,264 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-17 13:46:20,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-17 13:46:20,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 13:46:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 13:46:20,440 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-17 13:46:20,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-17 13:46:20,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 13:46:20,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2024-10-17 13:46:20,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-17 13:46:20,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2024-10-17 13:46:20,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:46:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:46:20,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:46:22,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 13:46:22,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:46:22,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 237 [2024-10-17 13:46:22,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 13:46:22,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2024-10-17 13:46:22,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:46:22,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2024-10-17 13:46:22,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-10-17 13:46:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:46:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715566037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:46:24,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 13:46:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-10-17 13:46:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263836794] [2024-10-17 13:46:24,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 13:46:24,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-17 13:46:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 13:46:24,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-17 13:46:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1824, Unknown=16, NotChecked=0, Total=1980 [2024-10-17 13:46:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:24,705 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:24,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:24,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:24,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:46:24,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-17 13:46:24,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 13:46:24,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 13:46:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-17 13:46:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 13:46:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 13:46:28,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-17 13:46:28,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-17 13:46:28,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:46:28,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-10-17 13:46:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 878789567, now seen corresponding path program 1 times [2024-10-17 13:46:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:46:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-17 13:46:45,283 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCounterexampleChecker.getInterpolants(ConditionalCommutativityCounterexampleChecker.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms at de.uni_freiburg.informatik.ultimate.logic.NoopScript.annotate(NoopScript.java:471) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 29 more [2024-10-17 13:46:45,286 INFO L158 Benchmark]: Toolchain (without parser) took 74634.78ms. Allocated memory was 159.4MB in the beginning and 497.0MB in the end (delta: 337.6MB). Free memory was 86.8MB in the beginning and 318.0MB in the end (delta: -231.2MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2024-10-17 13:46:45,286 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-17 13:46:45,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.46ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 86.6MB in the beginning and 162.7MB in the end (delta: -76.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-17 13:46:45,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.59ms. Allocated memory is still 197.1MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-17 13:46:45,286 INFO L158 Benchmark]: Boogie Preprocessor took 27.21ms. Allocated memory is still 197.1MB. Free memory was 160.6MB in the beginning and 159.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-17 13:46:45,286 INFO L158 Benchmark]: RCFGBuilder took 602.60ms. Allocated memory is still 197.1MB. Free memory was 159.6MB in the beginning and 136.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-17 13:46:45,287 INFO L158 Benchmark]: TraceAbstraction took 73436.46ms. Allocated memory was 197.1MB in the beginning and 497.0MB in the end (delta: 299.9MB). Free memory was 135.5MB in the beginning and 318.0MB in the end (delta: -182.5MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2024-10-17 13:46:45,288 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 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.46ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 86.6MB in the beginning and 162.7MB in the end (delta: -76.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.59ms. Allocated memory is still 197.1MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.21ms. Allocated memory is still 197.1MB. Free memory was 160.6MB in the beginning and 159.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.60ms. Allocated memory is still 197.1MB. Free memory was 159.6MB in the beginning and 136.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 73436.46ms. Allocated memory was 197.1MB in the beginning and 497.0MB in the end (delta: 299.9MB). Free memory was 135.5MB in the beginning and 318.0MB in the end (delta: -182.5MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 802, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 802, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 802, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 802, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1203, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 829, dependent conditional: 0, dependent unconditional: 829, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1203, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 829, dependent conditional: 0, dependent unconditional: 829, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 33, Persistent sets #1 benchmarks: Persistent set computation time: 1.2s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1203, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 829, dependent conditional: 0, dependent unconditional: 829, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1203, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 829, dependent conditional: 0, dependent unconditional: 829, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 33 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-17 13:46:45,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-10-17 13:46:45,521 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-17 13:46:45,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-10-17 13:46:45,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-17 13:46:46,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 13:46:48,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 13:46:48,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-17 13:46:48,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 13:46:48,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 13:46:48,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 13:46:48,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 13:46:48,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 13:46:48,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 13:46:48,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 13:46:48,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 13:46:48,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 13:46:48,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 13:46:48,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 13:46:48,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 13:46:48,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 13:46:48,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 13:46:48,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 13:46:48,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 13:46:48,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 13:46:48,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 13:46:48,506 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-17 13:46:48,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 13:46:48,507 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-17 13:46:48,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 13:46:48,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 13:46:48,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 13:46:48,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 13:46:48,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 13:46:48,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 13:46:48,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 13:46:48,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 13:46:48,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 13:46:48,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 13:46:48,514 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 13:46:48,515 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-17 13:46:48,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 13:46:48,515 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 13:46:48,517 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-17 13:46:48,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 13:46:48,517 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-17 13:46:48,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 13:46:48,519 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 13:46:48,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-17 13:46:48,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 13:46:48,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 13:46:48,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 13:46:48,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 13:46:48,894 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 13:46:48,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 13:46:50,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 13:46:50,732 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 13:46:50,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 13:46:50,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6f2176089/b219e9b20c774be5926d7e4f8a9bc532/FLAG56f90da1a [2024-10-17 13:46:50,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6f2176089/b219e9b20c774be5926d7e4f8a9bc532 [2024-10-17 13:46:50,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 13:46:50,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 13:46:50,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 13:46:50,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 13:46:50,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 13:46:50,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 01:46:50" (1/1) ... [2024-10-17 13:46:50,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61305860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:50, skipping insertion in model container [2024-10-17 13:46:50,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 01:46:50" (1/1) ... [2024-10-17 13:46:50,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 13:46:51,211 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 13:46:51,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 13:46:51,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 13:46:51,292 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 13:46:51,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 13:46:51,341 INFO L204 MainTranslator]: Completed translation [2024-10-17 13:46:51,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51 WrapperNode [2024-10-17 13:46:51,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 13:46:51,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 13:46:51,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 13:46:51,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 13:46:51,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,398 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-10-17 13:46:51,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 13:46:51,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 13:46:51,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 13:46:51,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 13:46:51,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 13:46:51,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 13:46:51,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 13:46:51,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 13:46:51,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (1/1) ... [2024-10-17 13:46:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 13:46:51,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:51,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 13:46:51,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 13:46:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-17 13:46:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-17 13:46:51,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-17 13:46:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 13:46:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 13:46:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 13:46:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 13:46:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-17 13:46:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-17 13:46:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-17 13:46:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 13:46:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 13:46:51,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 13:46:51,524 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 13:46:51,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 13:46:51,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 13:46:51,940 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 13:46:51,941 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 13:46:52,108 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 13:46:52,109 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 13:46:52,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 01:46:52 BoogieIcfgContainer [2024-10-17 13:46:52,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 13:46:52,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 13:46:52,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 13:46:52,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 13:46:52,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 01:46:50" (1/3) ... [2024-10-17 13:46:52,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e49960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 01:46:52, skipping insertion in model container [2024-10-17 13:46:52,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 01:46:51" (2/3) ... [2024-10-17 13:46:52,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e49960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 01:46:52, skipping insertion in model container [2024-10-17 13:46:52,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 01:46:52" (3/3) ... [2024-10-17 13:46:52,121 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-17 13:46:52,139 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 13:46:52,140 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 13:46:52,140 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 13:46:52,184 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 13:46:52,231 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:46:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:46:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:52,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:46:52,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 13:46:52,332 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:46:52,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:52,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-17 13:46:52,356 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;@46c5aedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:46:52,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:46:52,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:46:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1901459519, now seen corresponding path program 1 times [2024-10-17 13:46:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:52,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414374163] [2024-10-17 13:46:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:52,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:52,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-17 13:46:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:52,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 13:46:52,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:52,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:52,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414374163] [2024-10-17 13:46:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414374163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:52,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:52,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:46:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572666792] [2024-10-17 13:46:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:52,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:46:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:46:52,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:46:52,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:52,876 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:52,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:53,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-17 13:46:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:53,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:46:53,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1726443972, now seen corresponding path program 1 times [2024-10-17 13:46:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976171926] [2024-10-17 13:46:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:53,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:53,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-17 13:46:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:53,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-17 13:46:53,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:53,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:46:53,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:46:53,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 13:46:53,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 13:46:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:53,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:53,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976171926] [2024-10-17 13:46:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976171926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:53,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:53,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 13:46:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328844932] [2024-10-17 13:46:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:53,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 13:46:53,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:53,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 13:46:53,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 13:46:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:53,853 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:53,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:53,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:53,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:46:54,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-17 13:46:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:54,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:46:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -102633002, now seen corresponding path program 1 times [2024-10-17 13:46:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876705503] [2024-10-17 13:46:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:54,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:54,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-17 13:46:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:54,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-17 13:46:54,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:54,586 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-17 13:46:54,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-17 13:46:54,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:46:54,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:46:54,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-17 13:46:54,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-17 13:46:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:54,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:54,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876705503] [2024-10-17 13:46:54,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876705503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:54,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:54,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 13:46:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259008345] [2024-10-17 13:46:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:54,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 13:46:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 13:46:54,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-17 13:46:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:54,721 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:54,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:54,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:54,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:46:54,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:46:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:46:55,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 13:46:55,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-17 13:46:55,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:55,282 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 13:46:55,284 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-17 13:46:55,288 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:46:55,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:46:55,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:55,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:46:55,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-17 13:46:55,325 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:46:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:55,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 13:46:55,327 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;@46c5aedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:46:55,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:46:55,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:46:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1941491556, now seen corresponding path program 1 times [2024-10-17 13:46:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189203690] [2024-10-17 13:46:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:55,518 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:55,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-17 13:46:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:55,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 13:46:55,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:55,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:55,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189203690] [2024-10-17 13:46:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189203690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:46:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091396079] [2024-10-17 13:46:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:55,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:46:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:46:55,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:46:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:55,575 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:55,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:55,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:55,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-17 13:46:56,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:56,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:46:56,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1255275433, now seen corresponding path program 1 times [2024-10-17 13:46:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393561313] [2024-10-17 13:46:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:56,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:56,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:56,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-17 13:46:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:56,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-17 13:46:56,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:56,212 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:46:56,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:46:56,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 13:46:56,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 13:46:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:46:56,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:56,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393561313] [2024-10-17 13:46:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393561313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:56,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:56,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 13:46:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211742237] [2024-10-17 13:46:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:56,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 13:46:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 13:46:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 13:46:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:56,359 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:56,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:56,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:56,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:46:56,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-17 13:46:56,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:56,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:46:56,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash 567669754, now seen corresponding path program 1 times [2024-10-17 13:46:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222563737] [2024-10-17 13:46:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:56,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:56,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:56,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:56,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-17 13:46:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:46:56,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:46:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:46:56,919 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-17 13:46:56,919 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 13:46:56,920 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 13:46:56,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-17 13:46:57,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:57,126 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 13:46:57,127 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-17 13:46:57,127 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 13:46:57,128 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 13:46:57,150 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 13:46:57,153 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:46:57,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:46:57,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:46:57,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:46:57,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-17 13:46:57,199 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:46:57,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:57,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 13:46:57,200 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;@46c5aedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:46:57,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:46:58,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:46:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1753159339, now seen corresponding path program 1 times [2024-10-17 13:46:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606625960] [2024-10-17 13:46:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:58,319 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:58,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-17 13:46:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:58,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 13:46:58,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:46:58,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:58,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:58,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606625960] [2024-10-17 13:46:58,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606625960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:58,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:58,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:46:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927994322] [2024-10-17 13:46:58,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:58,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:46:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:46:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:46:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:58,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:59,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-17 13:46:59,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:59,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:46:59,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:46:59,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1668501579, now seen corresponding path program 1 times [2024-10-17 13:46:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:46:59,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091816570] [2024-10-17 13:46:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:46:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:46:59,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:46:59,279 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:46:59,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-17 13:46:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:46:59,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 13:46:59,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:46:59,405 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:46:59,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:46:59,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 13:46:59,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 13:46:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:46:59,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:46:59,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:46:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091816570] [2024-10-17 13:46:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091816570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:46:59,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:46:59,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 13:46:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090235118] [2024-10-17 13:46:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:46:59,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 13:46:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:46:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 13:46:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 13:46:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:59,545 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:46:59,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:46:59,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:59,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:46:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:46:59,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-17 13:47:00,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:00,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:47:00,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1301353490, now seen corresponding path program 1 times [2024-10-17 13:47:00,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:00,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291066292] [2024-10-17 13:47:00,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:00,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:00,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:00,004 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:00,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-17 13:47:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:00,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-17 13:47:00,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:00,126 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 13:47:00,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 13:47:00,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 13:47:00,223 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:47:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:47:00,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-17 13:47:00,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-17 13:47:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:47:00,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:47:00,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (or (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) .cse0) (or (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_~vn~0#1|)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-10-17 13:47:00,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-10-17 13:47:00,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:47:00,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 26 [2024-10-17 13:47:00,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-10-17 13:47:00,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-17 13:47:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:47:00,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291066292] [2024-10-17 13:47:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291066292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:47:00,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 13:47:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-17 13:47:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137663213] [2024-10-17 13:47:00,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 13:47:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 13:47:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:00,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 13:47:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2024-10-17 13:47:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:00,573 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:00,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:00,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:00,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:47:00,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:47:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 13:47:00,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-17 13:47:01,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:01,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 13:47:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -763680015, now seen corresponding path program 1 times [2024-10-17 13:47:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036415334] [2024-10-17 13:47:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:01,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:01,100 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:01,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-17 13:47:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:47:01,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 13:47:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 13:47:01,228 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-17 13:47:01,229 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 13:47:01,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 13:47:01,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-17 13:47:01,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:01,431 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-17 13:47:01,432 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-17 13:47:01,432 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 13:47:01,432 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-17 13:47:01,461 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 13:47:01,463 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 13:47:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 13:47:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 13:47:01,465 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 13:47:01,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-17 13:47:01,501 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 13:47:01,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:01,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-17 13:47:01,502 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;@46c5aedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 13:47:01,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 13:47:03,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:47:03,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1980423421, now seen corresponding path program 1 times [2024-10-17 13:47:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24034840] [2024-10-17 13:47:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:03,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:03,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:03,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-17 13:47:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:03,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-17 13:47:03,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-17 13:47:03,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:47:03,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24034840] [2024-10-17 13:47:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24034840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:47:03,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:47:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 13:47:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957838905] [2024-10-17 13:47:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:47:03,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 13:47:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 13:47:03,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 13:47:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:03,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:03,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:03,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:04,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-17 13:47:05,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:05,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:47:05,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1408669934, now seen corresponding path program 1 times [2024-10-17 13:47:05,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:05,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497964899] [2024-10-17 13:47:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:05,065 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:05,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-17 13:47:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:05,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-17 13:47:05,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:05,471 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-17 13:47:05,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 13:47:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 13:47:05,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:47:05,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497964899] [2024-10-17 13:47:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497964899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:47:05,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:47:05,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-17 13:47:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838335518] [2024-10-17 13:47:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:47:05,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 13:47:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:05,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 13:47:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-17 13:47:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:05,530 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:05,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:05,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:05,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:05,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-17 13:47:06,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:06,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:47:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1103172430, now seen corresponding path program 1 times [2024-10-17 13:47:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:06,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608273734] [2024-10-17 13:47:06,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:06,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:06,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:06,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:06,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-17 13:47:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:06,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 13:47:06,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:06,291 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-17 13:47:06,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-17 13:47:06,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:47:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 13:47:06,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 13:47:06,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-10-17 13:47:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-17 13:47:06,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:47:06,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608273734] [2024-10-17 13:47:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608273734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:47:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:47:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 13:47:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648340919] [2024-10-17 13:47:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:47:06,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 13:47:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 13:47:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-17 13:47:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:06,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:06,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:06,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:06,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:06,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:47:06,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-17 13:47:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:06,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:47:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash 562594897, now seen corresponding path program 1 times [2024-10-17 13:47:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701522988] [2024-10-17 13:47:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:06,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:07,000 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:07,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-17 13:47:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:07,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-17 13:47:07,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:07,168 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:47:07,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:47:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 13:47:07,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 13:47:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 13:47:07,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:47:07,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701522988] [2024-10-17 13:47:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701522988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:47:07,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:47:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 13:47:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88610743] [2024-10-17 13:47:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:47:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 13:47:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 13:47:07,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-17 13:47:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:07,284 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:07,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:07,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:07,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:47:07,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:47:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:47:07,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-17 13:47:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:07,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:47:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1499213391, now seen corresponding path program 1 times [2024-10-17 13:47:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749828784] [2024-10-17 13:47:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:07,907 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:07,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-17 13:47:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:08,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-17 13:47:08,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:08,045 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 13:47:08,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 13:47:08,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 13:47:08,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 13:47:08,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 13:47:08,244 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:47:08,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:47:08,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 13:47:08,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 13:47:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:47:08,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:47:08,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-10-17 13:47:08,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (not .cse0) (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (bvadd |c_thr1Thread2of3ForFork0_~v~0#1| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)))))) is different from false [2024-10-17 13:47:08,504 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) is different from false [2024-10-17 13:47:10,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))))) is different from false [2024-10-17 13:47:10,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse6 |c_~#value~0.offset|) |c_thr1Thread1of3ForFork0_~v~0#1|))) (and (or .cse0 (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|)))))) (or (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse5))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))) (not .cse0))))) is different from false [2024-10-17 13:47:10,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse6 |c_~#value~0.offset|) |c_thr1Thread1of3ForFork0_~v~0#1|))) (and (or .cse0 (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|)))))) (or (not .cse0) (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (bvadd (_ bv1 32) |c_thr1Thread1of3ForFork0_~v~0#1|))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse5))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))))))) is different from false [2024-10-17 13:47:10,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) (select .cse2 |c_~#value~0.offset|))))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2024-10-17 13:47:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-17 13:47:11,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749828784] [2024-10-17 13:47:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749828784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:47:11,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 13:47:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-17 13:47:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951487005] [2024-10-17 13:47:11,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 13:47:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-17 13:47:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-17 13:47:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=162, Unknown=14, NotChecked=224, Total=462 [2024-10-17 13:47:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:11,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:11,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:11,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:11,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:11,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:47:11,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:47:11,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:47:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:47:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 13:47:12,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-17 13:47:12,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:12,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:47:12,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:47:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2110429268, now seen corresponding path program 1 times [2024-10-17 13:47:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:47:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086732777] [2024-10-17 13:47:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:47:12,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:47:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:47:12,712 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:47:12,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-17 13:47:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:47:12,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-17 13:47:12,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:47:12,870 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 13:47:12,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 13:47:12,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 13:47:13,049 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-17 13:47:13,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-10-17 13:47:13,264 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-10-17 13:47:13,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 83 [2024-10-17 13:47:13,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:47:13,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:47:13,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-17 13:47:13,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-17 13:47:13,759 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-17 13:47:13,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-10-17 13:47:14,010 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-17 13:47:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-17 13:47:14,413 INFO L349 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2024-10-17 13:47:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2024-10-17 13:47:14,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 13:47:14,444 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-17 13:47:14,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-17 13:47:14,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-17 13:47:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:47:14,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:47:14,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) is different from false [2024-10-17 13:47:14,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-10-17 13:47:15,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse1 (select .cse3 |c_~#value~0.offset|))) (let ((.cse4 (bvadd (_ bv1 32) .cse1))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1) (= (_ bv0 32) .cse4) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|)))))))))) (or (not .cse0) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse6 (store (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (select (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse8 (bvadd (_ bv1 32) .cse5))) (or (not (bvugt .cse5 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| .cse8)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= (_ bv0 32) .cse8))))))))))) is different from false [2024-10-17 13:47:15,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (= .cse1 (_ bv0 32)) (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-10-17 13:47:16,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (v_ArrVal_274 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (not (= (_ bv0 1) (select (store (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_274) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= .cse1 (_ bv0 32)) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-10-17 13:47:16,219 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-10-17 13:47:16,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 316 treesize of output 308 [2024-10-17 13:47:16,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:47:16,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 136 [2024-10-17 13:47:16,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:47:16,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2024-10-17 13:47:16,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 134 [2024-10-17 13:47:16,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:47:16,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 75 [2024-10-17 13:47:16,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 13:47:16,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2024-10-17 13:47:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-17 13:47:21,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:47:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086732777] [2024-10-17 13:47:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086732777] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:47:21,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 13:47:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-10-17 13:47:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318459868] [2024-10-17 13:47:21,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 13:47:21,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-17 13:47:21,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:47:21,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-17 13:47:21,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=409, Unknown=22, NotChecked=230, Total=756 [2024-10-17 13:47:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:21,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:47:21,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:47:21,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:21,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:47:21,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:47:21,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:47:21,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 13:47:21,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:47:26,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 13:47:28,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:30,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:32,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:34,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:36,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:39,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:41,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:44,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 13:47:46,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:49,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:51,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:53,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:55,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:47:56,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse6 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse6))) (.cse2 (= (_ bv0 32) .cse6))) (and (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (_ bv0 1))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (let ((.cse5 (bvadd (_ bv1 32) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (let ((.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3))) (= (_ bv0 32) .cse5)))))))) is different from false [2024-10-17 13:47:59,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 13:48:03,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 13:48:06,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:48:08,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5))) (.cse2 (= (_ bv0 32) .cse5)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv3 32) |c_~#value~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))))))) is different from false [2024-10-17 13:48:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:48:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:48:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:48:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-17 13:48:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-17 13:48:11,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-17 13:48:12,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:48:12,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:48:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:48:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1277000128, now seen corresponding path program 1 times [2024-10-17 13:48:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:48:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474747313] [2024-10-17 13:48:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:48:12,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:48:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:48:12,165 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:48:12,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-17 13:48:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:48:12,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-17 13:48:12,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:48:12,332 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-17 13:48:12,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-17 13:48:12,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:48:12,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:48:12,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-17 13:48:12,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-17 13:48:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 13:48:12,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 13:48:12,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:48:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474747313] [2024-10-17 13:48:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474747313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 13:48:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 13:48:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-17 13:48:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836665905] [2024-10-17 13:48:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 13:48:12,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 13:48:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:48:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 13:48:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-17 13:48:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:12,465 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:48:12,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-17 13:48:12,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:48:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:48:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:48:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-17 13:48:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-17 13:48:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 13:48:15,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-17 13:48:15,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:48:15,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:48:15,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 13:48:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1825917863, now seen corresponding path program 1 times [2024-10-17 13:48:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-17 13:48:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640898911] [2024-10-17 13:48:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:48:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:48:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-17 13:48:15,918 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-17 13:48:15,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-17 13:48:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 13:48:16,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-17 13:48:16,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 13:48:16,078 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-17 13:48:16,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-17 13:48:16,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-17 13:48:16,212 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-17 13:48:16,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-17 13:48:16,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 13:48:16,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-10-17 13:48:16,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 13:48:16,419 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-17 13:48:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-17 13:48:16,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-10-17 13:48:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 13:48:16,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 13:48:17,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (_ bv0 1) (select |c_#valid| |c_~#value~0.base|)))) (.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (not .cse0)))) is different from false [2024-10-17 13:48:17,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-10-17 13:48:17,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-10-17 13:48:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 13:48:24,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-17 13:48:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640898911] [2024-10-17 13:48:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640898911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 13:48:24,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-17 13:48:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-10-17 13:48:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239171517] [2024-10-17 13:48:24,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-17 13:48:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 13:48:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-17 13:48:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 13:48:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=286, Unknown=24, NotChecked=36, Total=420 [2024-10-17 13:48:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:24,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 13:48:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 13:48:24,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:24,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:48:24,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:48:24,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:48:24,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-17 13:48:24,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-17 13:48:24,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 13:48:24,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:42,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse7 (bvadd (_ bv1 32) .cse1))) (let ((.cse6 (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32))) (.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse7))) (.cse2 (= (_ bv0 32) .cse7)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1)) (.cse5 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32)))))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (= (_ bv3 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) .cse5) (not (= (_ bv0 32) .cse6)) (= |c_thr1Thread2of3ForFork0_~v~0#1| .cse6) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) (= (_ bv3 32) |c_~#value~0.base|) .cse5))))) is different from false [2024-10-17 13:48:45,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 13:48:47,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 13:48:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 13:48:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 13:48:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 13:48:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 13:48:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-17 13:48:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-17 13:48:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 13:48:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 13:48:47,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-17 13:48:47,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-17 13:48:47,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 13:48:47,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-10-17 13:48:47,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-17 13:48:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash 453977815, now seen corresponding path program 1 times [2024-10-17 13:48:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 13:48:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 13:48:50,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 13:48:50,375 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCounterexampleChecker.getInterpolants(ConditionalCommutativityCounterexampleChecker.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:672) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 29 more [2024-10-17 13:48:50,379 INFO L158 Benchmark]: Toolchain (without parser) took 119603.03ms. Allocated memory was 65.0MB in the beginning and 281.0MB in the end (delta: 216.0MB). Free memory was 42.3MB in the beginning and 176.4MB in the end (delta: -134.1MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2024-10-17 13:48:50,380 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 65.0MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-17 13:48:50,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.79ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 42.1MB in the beginning and 61.3MB in the end (delta: -19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-17 13:48:50,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.29ms. Allocated memory is still 90.2MB. Free memory was 61.3MB in the beginning and 59.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-17 13:48:50,380 INFO L158 Benchmark]: Boogie Preprocessor took 33.81ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-17 13:48:50,380 INFO L158 Benchmark]: RCFGBuilder took 675.81ms. Allocated memory is still 90.2MB. Free memory was 57.2MB in the beginning and 56.6MB in the end (delta: 583.2kB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-17 13:48:50,380 INFO L158 Benchmark]: TraceAbstraction took 118265.84ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 55.1MB in the beginning and 176.4MB in the end (delta: -121.3MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-10-17 13:48:50,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 65.0MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.79ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 42.1MB in the beginning and 61.3MB in the end (delta: -19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.29ms. Allocated memory is still 90.2MB. Free memory was 61.3MB in the beginning and 59.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.81ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 675.81ms. Allocated memory is still 90.2MB. Free memory was 57.2MB in the beginning and 56.6MB in the end (delta: 583.2kB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 118265.84ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 55.1MB in the beginning and 176.4MB in the end (delta: -121.3MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1050, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 682, dependent conditional: 0, dependent unconditional: 682, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1050, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 682, dependent conditional: 0, dependent unconditional: 682, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 1.1s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1050, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 682, dependent conditional: 0, dependent unconditional: 682, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1050, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 682, dependent conditional: 0, dependent unconditional: 682, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 483, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 483, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 483, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 483, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1845, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 1248, dependent conditional: 0, dependent unconditional: 1248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1845, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 1248, dependent conditional: 0, dependent unconditional: 1248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 34, Persistent sets #1 benchmarks: Persistent set computation time: 1.9s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1845, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 1248, dependent conditional: 0, dependent unconditional: 1248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1845, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 1248, dependent conditional: 0, dependent unconditional: 1248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92 ], Independence queries for same thread: 34 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-17 13:48:50,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2024-10-17 13:48:50,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2024-10-17 13:48:50,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-10-17 13:48:51,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-17 13:48:51,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode