./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/lamport.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.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 c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 18:28:58,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 18:28:58,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 18:28:58,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 18:28:58,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 18:28:58,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 18:28:58,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 18:28:58,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 18:28:58,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 18:28:58,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 18:28:58,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 18:28:58,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 18:28:58,319 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 18:28:58,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 18:28:58,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 18:28:58,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 18:28:58,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 18:28:58,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 18:28:58,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 18:28:58,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 18:28:58,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 18:28:58,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 18:28:58,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 18:28:58,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 18:28:58,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 18:28:58,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 18:28:58,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 18:28:58,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 18:28:58,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 18:28:58,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 18:28:58,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 18:28:58,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 18:28:58,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 18:28:58,324 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 18:28:58,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 18:28:58,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 18:28:58,325 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 18:28:58,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 18:28:58,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 18:28:58,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 18:28:58,326 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 18:28:58,326 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 -> c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-18 18:28:58,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 18:28:58,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 18:28:58,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 18:28:58,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 18:28:58,538 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 18:28:58,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2024-10-18 18:28:59,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 18:28:59,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 18:28:59,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2024-10-18 18:28:59,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b78106fc/869400eed64c4f4f885ac7d481359fb1/FLAG6c6678795 [2024-10-18 18:28:59,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b78106fc/869400eed64c4f4f885ac7d481359fb1 [2024-10-18 18:28:59,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 18:28:59,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 18:28:59,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 18:28:59,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 18:28:59,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 18:28:59,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 06:28:59" (1/1) ... [2024-10-18 18:28:59,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31800387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:28:59, skipping insertion in model container [2024-10-18 18:28:59,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 06:28:59" (1/1) ... [2024-10-18 18:29:00,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 18:29:00,299 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-10-18 18:29:00,308 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-10-18 18:29:00,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 18:29:00,322 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 18:29:00,355 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-10-18 18:29:00,361 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-10-18 18:29:00,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 18:29:00,399 INFO L204 MainTranslator]: Completed translation [2024-10-18 18:29:00,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00 WrapperNode [2024-10-18 18:29:00,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 18:29:00,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 18:29:00,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 18:29:00,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 18:29:00,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,443 INFO L138 Inliner]: procedures = 169, calls = 72, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-18 18:29:00,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 18:29:00,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 18:29:00,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 18:29:00,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 18:29:00,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 18:29:00,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 18:29:00,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 18:29:00,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 18:29:00,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (1/1) ... [2024-10-18 18:29:00,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 18:29:00,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 18:29:00,514 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-18 18:29:00,516 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-18 18:29:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-18 18:29:00,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-18 18:29:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 18:29:00,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 18:29:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 18:29:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 18:29:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 18:29:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 18:29:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 18:29:00,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 18:29:00,556 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 18:29:00,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 18:29:00,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 18:29:00,769 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 18:29:00,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 18:29:00,836 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 18:29:00,836 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-18 18:29:00,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 06:29:00 BoogieIcfgContainer [2024-10-18 18:29:00,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 18:29:00,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 18:29:00,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 18:29:00,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 18:29:00,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 06:28:59" (1/3) ... [2024-10-18 18:29:00,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5085db27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 06:29:00, skipping insertion in model container [2024-10-18 18:29:00,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:00" (2/3) ... [2024-10-18 18:29:00,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5085db27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 06:29:00, skipping insertion in model container [2024-10-18 18:29:00,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 06:29:00" (3/3) ... [2024-10-18 18:29:00,848 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-10-18 18:29:00,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 18:29:00,861 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-18 18:29:00,861 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 18:29:00,905 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-18 18:29:00,942 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 18:29:00,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 18:29:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 18:29:00,944 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-18 18:29:00,946 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-18 18:29:01,026 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 18:29:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:01,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork1 ======== [2024-10-18 18:29:01,047 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;@672e5272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 18:29:01,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 18:29:01,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:01,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1564198736, now seen corresponding path program 1 times [2024-10-18 18:29:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064718492] [2024-10-18 18:29:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:01,474 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-18 18:29:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064718492] [2024-10-18 18:29:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064718492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 18:29:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585575765] [2024-10-18 18:29:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:01,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 18:29:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 18:29:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 18:29:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:01,505 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:01,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-18 18:29:01,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1811514099, now seen corresponding path program 1 times [2024-10-18 18:29:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:01,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 18:29:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1516063723, now seen corresponding path program 1 times [2024-10-18 18:29:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-18 18:29:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-18 18:29:02,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1291242947, now seen corresponding path program 1 times [2024-10-18 18:29:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200533051] [2024-10-18 18:29:02,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:02,313 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-18 18:29:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200533051] [2024-10-18 18:29:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200533051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 18:29:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784355629] [2024-10-18 18:29:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:02,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 18:29:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 18:29:02,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 18:29:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,317 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:02,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 18:29:02,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:02,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 18:29:02,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1328314988, now seen corresponding path program 1 times [2024-10-18 18:29:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125970457] [2024-10-18 18:29:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:02,501 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-18 18:29:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125970457] [2024-10-18 18:29:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125970457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-18 18:29:02,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718777586] [2024-10-18 18:29:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:02,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 18:29:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:02,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 18:29:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:02,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-18 18:29:02,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:02,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -652870154, now seen corresponding path program 1 times [2024-10-18 18:29:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:02,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1557282973, now seen corresponding path program 1 times [2024-10-18 18:29:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:02,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash -262117065, now seen corresponding path program 1 times [2024-10-18 18:29:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:02,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:02,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash -704523723, now seen corresponding path program 1 times [2024-10-18 18:29:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash 423884696, now seen corresponding path program 1 times [2024-10-18 18:29:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:03,085 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-18 18:29:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:03,109 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-18 18:29:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-18 18:29:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash -652870087, now seen corresponding path program 1 times [2024-10-18 18:29:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1557283022, now seen corresponding path program 1 times [2024-10-18 18:29:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -262117042, now seen corresponding path program 1 times [2024-10-18 18:29:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash -704523700, now seen corresponding path program 1 times [2024-10-18 18:29:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1122432727, now seen corresponding path program 1 times [2024-10-18 18:29:03,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-18 18:29:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash -652870060, now seen corresponding path program 1 times [2024-10-18 18:29:03,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1557283049, now seen corresponding path program 1 times [2024-10-18 18:29:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash -262117015, now seen corresponding path program 1 times [2024-10-18 18:29:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -704523673, now seen corresponding path program 1 times [2024-10-18 18:29:03,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash 431179805, now seen corresponding path program 1 times [2024-10-18 18:29:03,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 483366342, now seen corresponding path program 1 times [2024-10-18 18:29:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:03,859 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-18 18:29:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:03,897 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-18 18:29:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-18 18:29:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash -652870032, now seen corresponding path program 1 times [2024-10-18 18:29:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:03,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1557283079, now seen corresponding path program 1 times [2024-10-18 18:29:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -262116983, now seen corresponding path program 1 times [2024-10-18 18:29:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -704523639, now seen corresponding path program 1 times [2024-10-18 18:29:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 431179833, now seen corresponding path program 1 times [2024-10-18 18:29:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1528663619, now seen corresponding path program 1 times [2024-10-18 18:29:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:04,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-18 18:29:04,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:04,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1328653280, now seen corresponding path program 1 times [2024-10-18 18:29:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:04,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133229229] [2024-10-18 18:29:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:04,223 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-18 18:29:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133229229] [2024-10-18 18:29:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133229229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:04,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:04,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-18 18:29:04,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310021749] [2024-10-18 18:29:04,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:04,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 18:29:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:04,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 18:29:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:04,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:04,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 18:29:04,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:04,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:04,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:04,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash -652870000, now seen corresponding path program 1 times [2024-10-18 18:29:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash -262116954, now seen corresponding path program 1 times [2024-10-18 18:29:04,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -704523612, now seen corresponding path program 1 times [2024-10-18 18:29:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 431179860, now seen corresponding path program 1 times [2024-10-18 18:29:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1528663644, now seen corresponding path program 1 times [2024-10-18 18:29:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1002910521, now seen corresponding path program 1 times [2024-10-18 18:29:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1724088443, now seen corresponding path program 1 times [2024-10-18 18:29:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash -205501545, now seen corresponding path program 1 times [2024-10-18 18:29:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash -364369116, now seen corresponding path program 1 times [2024-10-18 18:29:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1545990127, now seen corresponding path program 1 times [2024-10-18 18:29:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:04,717 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-18 18:29:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:04,734 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-18 18:29:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 18:29:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-18 18:29:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 431179903, now seen corresponding path program 1 times [2024-10-18 18:29:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1528663687, now seen corresponding path program 1 times [2024-10-18 18:29:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1002910560, now seen corresponding path program 1 times [2024-10-18 18:29:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:04,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash -205501507, now seen corresponding path program 1 times [2024-10-18 18:29:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash -364369086, now seen corresponding path program 1 times [2024-10-18 18:29:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 831663705, now seen corresponding path program 1 times [2024-10-18 18:29:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1239090221, now seen corresponding path program 1 times [2024-10-18 18:29:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:05,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39 [2024-10-18 18:29:05,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:05,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash 658914435, now seen corresponding path program 1 times [2024-10-18 18:29:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:05,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534200848] [2024-10-18 18:29:05,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 18:29:05,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:05,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534200848] [2024-10-18 18:29:05,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534200848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:05,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:05,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-18 18:29:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853381974] [2024-10-18 18:29:05,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:05,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 18:29:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:05,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 18:29:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,270 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:05,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-18 18:29:05,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:05,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:05,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:05,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash -205501469, now seen corresponding path program 1 times [2024-10-18 18:29:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -364369048, now seen corresponding path program 1 times [2024-10-18 18:29:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash 831663741, now seen corresponding path program 1 times [2024-10-18 18:29:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1239090253, now seen corresponding path program 1 times [2024-10-18 18:29:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:05,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55 [2024-10-18 18:29:05,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1796703788, now seen corresponding path program 2 times [2024-10-18 18:29:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:05,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661913437] [2024-10-18 18:29:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:05,503 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-18 18:29:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661913437] [2024-10-18 18:29:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661913437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:05,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-18 18:29:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392040559] [2024-10-18 18:29:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 18:29:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 18:29:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,505 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 18:29:05,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:05,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:05,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:05,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:05,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -205501437, now seen corresponding path program 1 times [2024-10-18 18:29:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash -364369016, now seen corresponding path program 1 times [2024-10-18 18:29:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 831663773, now seen corresponding path program 1 times [2024-10-18 18:29:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1239090285, now seen corresponding path program 1 times [2024-10-18 18:29:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2104449313, now seen corresponding path program 1 times [2024-10-18 18:29:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 245857659, now seen corresponding path program 1 times [2024-10-18 18:29:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 18:29:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 18:29:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:05,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2024-10-18 18:29:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -364368979, now seen corresponding path program 1 times [2024-10-18 18:29:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 831663812, now seen corresponding path program 1 times [2024-10-18 18:29:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1239090326, now seen corresponding path program 1 times [2024-10-18 18:29:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash 912341564, now seen corresponding path program 1 times [2024-10-18 18:29:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1961602358, now seen corresponding path program 1 times [2024-10-18 18:29:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -391244004, now seen corresponding path program 1 times [2024-10-18 18:29:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2105548561, now seen corresponding path program 1 times [2024-10-18 18:29:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash -332790490, now seen corresponding path program 1 times [2024-10-18 18:29:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1984608568, now seen corresponding path program 1 times [2024-10-18 18:29:06,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -25030251, now seen corresponding path program 1 times [2024-10-18 18:29:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 18:29:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 18:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 18:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 18:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 18:29:06,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 18:29:06,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable60,SelfDestructingSolverStorable71,SelfDestructingSolverStorable61,SelfDestructingSolverStorable72,SelfDestructingSolverStorable62,SelfDestructingSolverStorable73,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable56,SelfDestructingSolverStorable67,SelfDestructingSolverStorable57,SelfDestructingSolverStorable68,SelfDestructingSolverStorable58,SelfDestructingSolverStorable69,SelfDestructingSolverStorable59 [2024-10-18 18:29:06,749 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-18 18:29:06,750 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork1 was SAFE (1/3) [2024-10-18 18:29:06,753 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 18:29:06,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 18:29:06,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 18:29:06,754 INFO L229 MonitoredProcess]: Starting monitored process 3 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-18 18:29:06,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-18 18:29:06,778 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 18:29:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:06,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 18:29:06,779 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@672e5272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 18:29:06,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 18:29:06,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-18 18:29:06,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-10-18 18:29:06,855 INFO L414 BasicCegarLoop]: Path program histogram: [] [2024-10-18 18:29:06,855 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2024-10-18 18:29:06,857 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 18:29:06,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 18:29:06,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 18:29:06,861 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-18 18:29:06,862 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-18 18:29:06,886 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 18:29:06,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:06,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr2Thread1of1ForFork0 ======== [2024-10-18 18:29:06,887 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;@672e5272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 18:29:06,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 18:29:06,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:06,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:06,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1069910251, now seen corresponding path program 1 times [2024-10-18 18:29:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:06,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513939546] [2024-10-18 18:29:06,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:06,991 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-18 18:29:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 18:29:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513939546] [2024-10-18 18:29:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513939546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:06,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:06,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 18:29:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006555994] [2024-10-18 18:29:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 18:29:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 18:29:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 18:29:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 18:29:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:06,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:06,993 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-18 18:29:06,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1811513574, now seen corresponding path program 1 times [2024-10-18 18:29:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:07,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 18:29:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1516063198, now seen corresponding path program 1 times [2024-10-18 18:29:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 18:29:07,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 18:29:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-18 18:29:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:07,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78 [2024-10-18 18:29:07,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1251018569, now seen corresponding path program 1 times [2024-10-18 18:29:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 18:29:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141239829] [2024-10-18 18:29:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-10-18 18:29:07,269 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@42e13be9 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:50) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.postprocessInterpolant(NestedInterpolantsBuilder.java:393) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.buildPredicates(NestedInterpolantsBuilder.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:156) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:320) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-18 18:29:07,272 INFO L158 Benchmark]: Toolchain (without parser) took 7303.21ms. Allocated memory was 165.7MB in the beginning and 270.5MB in the end (delta: 104.9MB). Free memory was 113.0MB in the beginning and 158.6MB in the end (delta: -45.6MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-10-18 18:29:07,273 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 18:29:07,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.54ms. Allocated memory is still 165.7MB. Free memory was 112.5MB in the beginning and 89.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-18 18:29:07,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 165.7MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 18:29:07,273 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 165.7MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 18:29:07,273 INFO L158 Benchmark]: RCFGBuilder took 358.25ms. Allocated memory is still 165.7MB. Free memory was 85.8MB in the beginning and 133.8MB in the end (delta: -47.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-10-18 18:29:07,274 INFO L158 Benchmark]: TraceAbstraction took 6430.08ms. Allocated memory was 165.7MB in the beginning and 270.5MB in the end (delta: 104.9MB). Free memory was 132.9MB in the beginning and 158.6MB in the end (delta: -25.7MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2024-10-18 18:29:07,274 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.14ms. Allocated memory is still 165.7MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.54ms. Allocated memory is still 165.7MB. Free memory was 112.5MB in the beginning and 89.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 165.7MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 165.7MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.25ms. Allocated memory is still 165.7MB. Free memory was 85.8MB in the beginning and 133.8MB in the end (delta: -47.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6430.08ms. Allocated memory was 165.7MB in the beginning and 270.5MB in the end (delta: 104.9MB). Free memory was 132.9MB in the beginning and 158.6MB in the end (delta: -25.7MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17344, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 1533, dependent conditional: 1465, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16159, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 348, dependent conditional: 280, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16159, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 348, dependent conditional: 280, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16159, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 348, dependent conditional: 280, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 1559, dependent conditional: 1423, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3450, independent: 3248, independent conditional: 138, independent unconditional: 3110, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3450, independent: 3221, independent conditional: 0, independent unconditional: 3221, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1647, independent: 233, independent conditional: 174, independent unconditional: 59, dependent: 1415, dependent conditional: 767, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17370, independent: 12563, independent conditional: 3689, independent unconditional: 8874, dependent: 1357, dependent conditional: 249, dependent unconditional: 1108, unknown: 3450, unknown conditional: 272, unknown unconditional: 3178] , Statistics on independence cache: Total cache size (in pairs): 3450, Positive cache size: 3248, Positive conditional cache size: 138, Positive unconditional cache size: 3110, Negative cache size: 202, Negative conditional cache size: 134, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8451, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 1559, dependent conditional: 1423, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3450, independent: 3248, independent conditional: 138, independent unconditional: 3110, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3450, independent: 3221, independent conditional: 0, independent unconditional: 3221, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1647, independent: 233, independent conditional: 174, independent unconditional: 59, dependent: 1415, dependent conditional: 767, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17370, independent: 12563, independent conditional: 3689, independent unconditional: 8874, dependent: 1357, dependent conditional: 249, dependent unconditional: 1108, unknown: 3450, unknown conditional: 272, unknown unconditional: 3178] , Statistics on independence cache: Total cache size (in pairs): 3450, Positive cache size: 3248, Positive conditional cache size: 138, Positive unconditional cache size: 3110, Negative cache size: 202, Negative conditional cache size: 134, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8451 ], Independence queries for same thread: 1185, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 897, Number of trivial persistent sets: 827, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4540, independent: 4473, independent conditional: 0, independent unconditional: 4473, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17344, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 1533, dependent conditional: 1465, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16159, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 348, dependent conditional: 280, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16159, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 348, dependent conditional: 280, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16159, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 348, dependent conditional: 280, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 1559, dependent conditional: 1423, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3450, independent: 3248, independent conditional: 138, independent unconditional: 3110, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3450, independent: 3221, independent conditional: 0, independent unconditional: 3221, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1647, independent: 233, independent conditional: 174, independent unconditional: 59, dependent: 1415, dependent conditional: 767, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17370, independent: 12563, independent conditional: 3689, independent unconditional: 8874, dependent: 1357, dependent conditional: 249, dependent unconditional: 1108, unknown: 3450, unknown conditional: 272, unknown unconditional: 3178] , Statistics on independence cache: Total cache size (in pairs): 3450, Positive cache size: 3248, Positive conditional cache size: 138, Positive unconditional cache size: 3110, Negative cache size: 202, Negative conditional cache size: 134, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8451, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 11238, independent unconditional: 4573, dependent: 1559, dependent conditional: 1423, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17370, independent: 15811, independent conditional: 3827, independent unconditional: 11984, dependent: 1559, dependent conditional: 383, dependent unconditional: 1176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3450, independent: 3248, independent conditional: 138, independent unconditional: 3110, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3450, independent: 3221, independent conditional: 0, independent unconditional: 3221, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 229, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 202, dependent conditional: 134, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1647, independent: 233, independent conditional: 174, independent unconditional: 59, dependent: 1415, dependent conditional: 767, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17370, independent: 12563, independent conditional: 3689, independent unconditional: 8874, dependent: 1357, dependent conditional: 249, dependent unconditional: 1108, unknown: 3450, unknown conditional: 272, unknown unconditional: 3178] , Statistics on independence cache: Total cache size (in pairs): 3450, Positive cache size: 3248, Positive conditional cache size: 138, Positive unconditional cache size: 3110, Negative cache size: 202, Negative conditional cache size: 134, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8451 ], Independence queries for same thread: 1185 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 366, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 366, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 368, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 360, unknown conditional: 0, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 358, Positive conditional cache size: 0, Positive unconditional cache size: 358, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 368, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 360, unknown conditional: 0, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 358, Positive conditional cache size: 0, Positive unconditional cache size: 358, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3 ], Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 6, Number of trivial persistent sets: 4, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 366, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 366, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 368, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 360, unknown conditional: 0, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 358, Positive conditional cache size: 0, Positive unconditional cache size: 358, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 3, independent unconditional: 361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 368, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 360, unknown conditional: 0, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 358, Positive conditional cache size: 0, Positive unconditional cache size: 358, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3 ], Independence queries for same thread: 2 - ExceptionOrErrorResult: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@42e13be9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@42e13be9: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-18 18:29:07,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-10-18 18:29:07,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-10-18 18:29:07,701 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-18 18:29:07,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-atomic/lamport.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 c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 18:29:09,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 18:29:09,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-18 18:29:09,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 18:29:09,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 18:29:09,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 18:29:09,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 18:29:09,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 18:29:09,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 18:29:09,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 18:29:09,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 18:29:09,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 18:29:09,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 18:29:09,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 18:29:09,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 18:29:09,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 18:29:09,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 18:29:09,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 18:29:09,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 18:29:09,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 18:29:09,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 18:29:09,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-18 18:29:09,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 18:29:09,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-18 18:29:09,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 18:29:09,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 18:29:09,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 18:29:09,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 18:29:09,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 18:29:09,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 18:29:09,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 18:29:09,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 18:29:09,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 18:29:09,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 18:29:09,827 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 18:29:09,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-18 18:29:09,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 18:29:09,828 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 18:29:09,828 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-18 18:29:09,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 18:29:09,828 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-18 18:29:09,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 18:29:09,829 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 18:29:09,829 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 -> c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-18 18:29:10,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 18:29:10,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 18:29:10,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 18:29:10,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 18:29:10,113 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 18:29:10,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2024-10-18 18:29:11,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 18:29:11,558 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 18:29:11,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2024-10-18 18:29:11,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cd15bfea/9044da4fb19b44dbae0fe677624487ae/FLAG0c6e1448f [2024-10-18 18:29:11,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cd15bfea/9044da4fb19b44dbae0fe677624487ae [2024-10-18 18:29:11,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 18:29:11,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 18:29:11,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 18:29:11,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 18:29:11,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 18:29:11,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 06:29:11" (1/1) ... [2024-10-18 18:29:11,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1b600f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:11, skipping insertion in model container [2024-10-18 18:29:11,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 06:29:11" (1/1) ... [2024-10-18 18:29:11,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 18:29:11,921 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-10-18 18:29:11,932 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-10-18 18:29:11,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 18:29:11,956 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 18:29:11,990 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-10-18 18:29:11,993 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-10-18 18:29:11,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 18:29:12,035 INFO L204 MainTranslator]: Completed translation [2024-10-18 18:29:12,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12 WrapperNode [2024-10-18 18:29:12,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 18:29:12,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 18:29:12,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 18:29:12,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 18:29:12,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,080 INFO L138 Inliner]: procedures = 170, calls = 72, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2024-10-18 18:29:12,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 18:29:12,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 18:29:12,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 18:29:12,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 18:29:12,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 18:29:12,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 18:29:12,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 18:29:12,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 18:29:12,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (1/1) ... [2024-10-18 18:29:12,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 18:29:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 18:29:12,145 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-18 18:29:12,147 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-18 18:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-18 18:29:12,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-18 18:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 18:29:12,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 18:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 18:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 18:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-18 18:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 18:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 18:29:12,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 18:29:12,178 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 18:29:12,290 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 18:29:12,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 18:29:12,472 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 18:29:12,475 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 18:29:12,543 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 18:29:12,544 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-18 18:29:12,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 06:29:12 BoogieIcfgContainer [2024-10-18 18:29:12,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 18:29:12,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 18:29:12,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 18:29:12,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 18:29:12,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 06:29:11" (1/3) ... [2024-10-18 18:29:12,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce228a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 06:29:12, skipping insertion in model container [2024-10-18 18:29:12,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 06:29:12" (2/3) ... [2024-10-18 18:29:12,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce228a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 06:29:12, skipping insertion in model container [2024-10-18 18:29:12,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 06:29:12" (3/3) ... [2024-10-18 18:29:12,552 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-10-18 18:29:12,566 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 18:29:12,567 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-18 18:29:12,567 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 18:29:12,619 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-18 18:29:12,662 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 18:29:12,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 18:29:12,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 18:29:12,665 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-18 18:29:12,666 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-18 18:29:12,743 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 18:29:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:12,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 18:29:12,762 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;@5ae61ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 18:29:12,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 18:29:13,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 18:29:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 18:29:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1678208074, now seen corresponding path program 1 times [2024-10-18 18:29:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 18:29:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998518736] [2024-10-18 18:29:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:13,026 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-18 18:29:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 18:29:13,053 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-18 18:29:13,054 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-18 18:29:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 18:29:13,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 18:29:13,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 18:29:13,113 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-18 18:29:13,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 18:29:13,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 18:29:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998518736] [2024-10-18 18:29:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998518736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 18:29:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 18:29:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 18:29:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29882696] [2024-10-18 18:29:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 18:29:13,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 18:29:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 18:29:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 18:29:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 18:29:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:13,140 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 18:29:13,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-18 18:29:13,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 18:29:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1550420243, now seen corresponding path program 1 times [2024-10-18 18:29:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 18:29:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 18:29:13,505 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 (3)] Forceful destruction successful, exit code 0 [2024-10-18 18:29:13,701 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,SelfDestructingSolverStorable0 [2024-10-18 18:29:13,702 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:672) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 40 more [2024-10-18 18:29:13,706 INFO L158 Benchmark]: Toolchain (without parser) took 2115.28ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 52.2MB in the end (delta: -16.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 18:29:13,706 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 54.5MB. Free memory was 29.0MB in the beginning and 28.9MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 18:29:13,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.61ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 45.7MB in the end (delta: -10.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-18 18:29:13,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.91ms. Allocated memory is still 69.2MB. Free memory was 45.7MB in the beginning and 43.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 18:29:13,711 INFO L158 Benchmark]: Boogie Preprocessor took 30.68ms. Allocated memory is still 69.2MB. Free memory was 43.6MB in the beginning and 41.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 18:29:13,711 INFO L158 Benchmark]: RCFGBuilder took 432.37ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 38.2MB in the end (delta: 3.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-18 18:29:13,711 INFO L158 Benchmark]: TraceAbstraction took 1159.02ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 36.8MB in the beginning and 52.2MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 18:29:13,713 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.89ms. Allocated memory is still 54.5MB. Free memory was 29.0MB in the beginning and 28.9MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.61ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 45.7MB in the end (delta: -10.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.91ms. Allocated memory is still 69.2MB. Free memory was 45.7MB in the beginning and 43.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.68ms. Allocated memory is still 69.2MB. Free memory was 43.6MB in the beginning and 41.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.37ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 38.2MB in the end (delta: 3.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1159.02ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 36.8MB in the beginning and 52.2MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-18 18:29:13,736 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-18 18:29:13,938 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